A crystal on decreasing factorizations in the 0-Hecke monoid (Q2185219): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jian-Ping Pan / rank
Normal rank
 
Property / author
 
Property / author: Jian-Ping Pan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2991355800 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1911.08732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial expansions in \(K\)-theoretic bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crystal Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Littlewood-Richardson rule for the \(K\)-theory of Grassmannians. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Gieseker–Petri theorem and imposed ramification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noncommutative Schur functions and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial aspects of the \(K\)-theory of Grassmannians / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to combinatorial formulas for Schubert polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Hopf Algebras and K-Homology of Grassmanians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crystal structures for symmetric Grothendieck polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crystal Approach to Affine Schubert Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antipode formulas for some combinatorial Hopf algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics of \(K\)-theory via a \(K\)-theoretic Poirier-Reutenauer bialgebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poset edge densities, nearly reduced words, and barely set-valued tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of reduced decompositions of elements of Coxeter groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fully commutative elements of Coxeter groups / rank
 
Normal rank

Latest revision as of 21:18, 22 July 2024

scientific article
Language Label Description Also known as
English
A crystal on decreasing factorizations in the 0-Hecke monoid
scientific article

    Statements

    A crystal on decreasing factorizations in the 0-Hecke monoid (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 June 2020
    0 references
    Summary: We introduce a type \(A\) crystal structure on decreasing factorizations of fully-commutative elements in the 0-Hecke monoid which we call \(\star\)-crystal. This crystal is a \(K\)-theoretic generalization of the crystal on decreasing factorizations in the symmetric group of the first and last author. We prove that under the residue map the \(\star\)-crystal intertwines with the crystal on set-valued tableaux recently introduced by \textit{C. Monical} et al. [Sémin. Lothar. Comb. 82B, 82B.27, 12 p. (2019; Zbl 1436.05131)]. We also define a new insertion from decreasing factorization to pairs of semistandard Young tableaux and prove several properties, such as its relation to the Hecke insertion and the uncrowding algorithm. The new insertion also intertwines with the crystal operators.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    semistandard Young tableaux
    0 references
    Hecke insertion
    0 references
    uncrowding algorithm
    0 references
    0 references
    0 references
    0 references