A unifying poset perspective on alternating sign matrices, plane partitions, Catalan objects, tournaments, and tableaux (Q534212): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(9 intermediate revisions by 6 users not shown) | |||
Property / review text | |||
This paper enumerates the order ideals in certain posets and relates the resulting enumeration problems to those of several well-known previously studied classes of objects, including those listed in the title. The \textit{tetrahedral poset} \(T_n\) is introduced as a certain partial ordering of the set of lattice points inside \(n{\mathcal T}\), where \({\mathcal T}\) is a tetrahedron having vertices \(a_0 = 0\), \(a_1\), \(a_2\), and \(a_3\), and with the lattice \(L\) generated by \(\{a_1, a_2, a_3\}\). A directed graph \({\mathcal G}\) having vertex set \(n{\mathcal T}\cap L\) is obtained, with \((u,v)\) a directed edge if \(v-u\) equals one of the differences \(a_j-a_i\), \(0\leq i<j\leq 3\). In the paper, some symmetries are emphasized by using a regular tetrahedron for \({\mathcal T}\). The full tetrahedral poset \(T_n\) is the set \(n{\mathcal T} \cap L\) with the partial ordering given by the transitive closure of the directed graph \({\mathcal G}\). The number of order ideals of \(T_n\) is shown to be equal to the number of totally symmetric plane partitions inside an \((n-1)\times (n-1) \times (n-1)\) box. The edges of the graph \({\mathcal G}\) are considered to be in six color classes corresponding to the six differences \(a_j - a_i\), and other partial orderings of the same set are obtained similarly from directed subgraphs of \({\mathcal G}\) whose edges have colors restricted to various subsets of the full set of colors. In all cases the expressions giving the solutions factor quite nicely. | |||
Property / review text: This paper enumerates the order ideals in certain posets and relates the resulting enumeration problems to those of several well-known previously studied classes of objects, including those listed in the title. The \textit{tetrahedral poset} \(T_n\) is introduced as a certain partial ordering of the set of lattice points inside \(n{\mathcal T}\), where \({\mathcal T}\) is a tetrahedron having vertices \(a_0 = 0\), \(a_1\), \(a_2\), and \(a_3\), and with the lattice \(L\) generated by \(\{a_1, a_2, a_3\}\). A directed graph \({\mathcal G}\) having vertex set \(n{\mathcal T}\cap L\) is obtained, with \((u,v)\) a directed edge if \(v-u\) equals one of the differences \(a_j-a_i\), \(0\leq i<j\leq 3\). In the paper, some symmetries are emphasized by using a regular tetrahedron for \({\mathcal T}\). The full tetrahedral poset \(T_n\) is the set \(n{\mathcal T} \cap L\) with the partial ordering given by the transitive closure of the directed graph \({\mathcal G}\). The number of order ideals of \(T_n\) is shown to be equal to the number of totally symmetric plane partitions inside an \((n-1)\times (n-1) \times (n-1)\) box. The edges of the graph \({\mathcal G}\) are considered to be in six color classes corresponding to the six differences \(a_j - a_i\), and other partial orderings of the same set are obtained similarly from directed subgraphs of \({\mathcal G}\) whose edges have colors restricted to various subsets of the full set of colors. In all cases the expressions giving the solutions factor quite nicely. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 06A07 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05E10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5895466 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
alternating sign matrices | |||
Property / zbMATH Keywords: alternating sign matrices / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
posets | |||
Property / zbMATH Keywords: posets / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
plane partitions | |||
Property / zbMATH Keywords: plane partitions / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Young tableaux | |||
Property / zbMATH Keywords: Young tableaux / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
order ideal | |||
Property / zbMATH Keywords: order ideal / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Catalan numbers | |||
Property / zbMATH Keywords: Catalan numbers / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
tournaments | |||
Property / zbMATH Keywords: tournaments / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: James F. Lawrence / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: ROBBINS / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: qTSPP / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1973852751 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1408.5391 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Plane partitions. V: The TSSCPP conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4705310 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two element lattice permutation numbers and their \(q\)-generalization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A refined Razumov–Stroganov conjecture: II / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The quantum Knizhnik–Zamolodchikov equation, generalized Razumov–Stroganov sum rules and extended Joseph polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Alternating-sign matrices and domino tilings. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5440030 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bijective proofs of shifted tableau and alternating sign matrix identities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4880965 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lattices and bases of Coxeter groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3947818 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Alternating sign matrices and descending plane partitions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the generating functions for certain classes of plane partitions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial nature of the ground-state vector of the \(\mathrm{O}(1)\) loop model / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Order dimension, strong Bruhat order and lattice properties for posets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Determinants and alternating sign matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4344108 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The enumeration of totally symmetric plane partitions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The poset perspective on alternating sign matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4004146 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proof of the alternating sign matrix conjecture / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:09, 4 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A unifying poset perspective on alternating sign matrices, plane partitions, Catalan objects, tournaments, and tableaux |
scientific article |
Statements
A unifying poset perspective on alternating sign matrices, plane partitions, Catalan objects, tournaments, and tableaux (English)
0 references
17 May 2011
0 references
This paper enumerates the order ideals in certain posets and relates the resulting enumeration problems to those of several well-known previously studied classes of objects, including those listed in the title. The \textit{tetrahedral poset} \(T_n\) is introduced as a certain partial ordering of the set of lattice points inside \(n{\mathcal T}\), where \({\mathcal T}\) is a tetrahedron having vertices \(a_0 = 0\), \(a_1\), \(a_2\), and \(a_3\), and with the lattice \(L\) generated by \(\{a_1, a_2, a_3\}\). A directed graph \({\mathcal G}\) having vertex set \(n{\mathcal T}\cap L\) is obtained, with \((u,v)\) a directed edge if \(v-u\) equals one of the differences \(a_j-a_i\), \(0\leq i<j\leq 3\). In the paper, some symmetries are emphasized by using a regular tetrahedron for \({\mathcal T}\). The full tetrahedral poset \(T_n\) is the set \(n{\mathcal T} \cap L\) with the partial ordering given by the transitive closure of the directed graph \({\mathcal G}\). The number of order ideals of \(T_n\) is shown to be equal to the number of totally symmetric plane partitions inside an \((n-1)\times (n-1) \times (n-1)\) box. The edges of the graph \({\mathcal G}\) are considered to be in six color classes corresponding to the six differences \(a_j - a_i\), and other partial orderings of the same set are obtained similarly from directed subgraphs of \({\mathcal G}\) whose edges have colors restricted to various subsets of the full set of colors. In all cases the expressions giving the solutions factor quite nicely.
0 references
alternating sign matrices
0 references
posets
0 references
plane partitions
0 references
Young tableaux
0 references
order ideal
0 references
Catalan numbers
0 references
tournaments
0 references
0 references