REVIEW 3 cited by
Crystal skeletons: Combinatorics and axioms
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
Crystal skeletons were introduced by Maas-Gari\'epy in 2023 by contracting quasi-crystal components in a crystal graph. On the representation theoretic level, crystal skeletons model the expansion of Schur functions into Gessel's quasisymmetric functions. Motivated by questions of Schur positivity, we provide a combinatorial description of crystal skeletons, and prove many new properties, including a conjecture by Maas-Gari\'epy that crystal skeletons generalize dual equivalence graphs. We then present a new axiomatic approach to crystal skeletons. We give three versions of the axioms based on $GL_n$-branching, $S_n$-branching, and local axioms in analogy to the local Stembridge axioms for crystals based on novel commutation relations.
Forward citations
Cited by 3 Pith papers
-
Compatibility of Higher Specht Polynomials and Decompositions of Representations
A compatibly normalized version of higher Specht polynomials gives stable polynomials in infinitely many variables, and the ordered-partition representations split into orbit pieces that lift induction and extension o...
-
Stable Higher Specht Polynomials and Representations of Infinite Symmetric Groups
Stable higher Specht polynomials indexed by infinite Ferrers diagrams give irreducible representations of the infinite symmetric group, and a conjectural f-indexed filtration describes all non-completely-reducible layers.
-
Generalized Higher Specht Polynomials and Homogeneous Representations of Symmetric Groups
The polynomial space Q[x_n]_d is written as a direct sum of explicit irreducible S_n-representations indexed by semistandard Young tableaux of entry sum d, and by cocharge-tableau pairs.
Discussion (0). Continue with ORCID to comment.