Macaulay2 » Documentation
Packages » MatchingFields > GrMatchingField
next | previous | forward | backward | up | index | toc

GrMatchingField -- the class of Grassmannian matching fields

Description

Common ways to define Grassmannian matching fields:

Two Grassmannian matching fields are said to be equal if and only if their tuples are the same.

Technical details. A Grassmannian matching field is derived from the class HashTable. All Grassmannian matching fields have the following fields:

  • k of type ZZ
  • n of type ZZ
  • tuples of type List, accessible withgetTuples
  • cache

Everything else, including: weight matrices; polynomial rings, maps and ideals; polyhedra such as the weight matrix cone and matching field polytope, are all stored inside the cache. Note that the package does not export the keys, such as k or n. If you wish to directly address the contents of the GrMatchingField, then use "debug MatchingFields".

See also

Functions and methods returning an object of class GrMatchingField :

Methods that use an object of class GrMatchingField :

For the programmer

The object GrMatchingField is a type, with ancestor classes HashTable < Thing.

Menu