forked from Macaulay2/M2
-
Notifications
You must be signed in to change notification settings - Fork 0
Functions_finished_so_far
Mahrud Sayrafi edited this page Mar 12, 2021
·
1 revision
So far we have finished
- Defining new type "Poset", a hash table indexed by a GroundSet and CRelations (short for "covering relations", although we can accept more relations than in the base covering set)
- Defined "FullRelationMatrix", a function that inputs a poset and outputs a matrix with a non-zero entry in position (i,j) if i<j is in our full set of relations.
- Defined "RelationMatrix" a function that inputs a poset (or a FullRelationMatrix of a poset) and outputs a matrix with 1 in position (i,j) if i<j is in our full set of relations.
- Defined "compare" a function that inputs a poset and a potential relation and tests whether that relation is in our poset.
- "indexElement" fn that given an element in the poset, it says which index it has in the ground set
- "nonnull" which gets rid of null elements in lists (usually obtained from using if then's in apply)
- "OrderIdeal" and "Filter"
-
Home
- Introduction
- Macaulay2 Contribution Guides
- Macaulay2 Workshop Guides
-
Macaulay2 Internals
- Building Macaulay2 from source
- Components of Macaulay2
- Case Studies
- Web servers
- Other
- Frequently Asked Questions
- Road map