It is what makes the partition-indexed notation s_{3,2,1} or s_(3,2,1) work: when you write s in a Schur ring, s is bound to a SchurRingIndexedVariableTable whose _ method accepts a list, a sequence, or an integer and returns the corresponding Schur-basis element. The same mechanism drives the partition-indexed notation in every flavor of SchurRing -- monomial, symplectic, orthogonal, symmetric-group, and rational-GL variants all share this indexing interface.
|
|
|
|
|
Each Schur ring comes with its own indexed variable table, and partitions with many parts print in the same compact way.
|
|
|
|
For rings with Basis => "Monomial", the same table selects the monomial-symmetric-function basis elements instead.
|
|
|
In the rational-GL flavor, subscripts are pairs of lists encoding positive and negative weights.
|
|
The object SchurRingIndexedVariableTable is a type, with ancestor classes IndexedVariableTable < MutableHashTable < HashTable < Thing.
The source of this document is in /build/reproducible-path/macaulay2-1.26.05+ds/M2/Macaulay2/packages/SchurRings.m2:5244:0.