Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
                                            Some full text articles may not yet be available without a charge during the embargo (administrative interval).
                                        
                                        
                                        
                                            
                                                
                                             What is a DOI Number?
                                        
                                    
                                
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
- 
            We provide a general framework for computing mixing times of finite Markov chains when its minimal ideal is left zero. Our analysis is based on combining results by Brown and Diaconis with our previous work on stationary distributions of finite Markov chains. We introduce a new Markov chain on linear extensions of a poset with n vertices, which is a variant of the promotion Markov chain of Ayyer, Klee and the last author, and show that it has a mixing time O(n log n).more » « less
- 
            Acu, B.; Danielli, D.; Lewicka, M.; Pati, A.; Saraswathy, RV; Teboh-Ewungkem, M. (Ed.)
- 
            We introduce a type $$A$$ crystal structure on decreasing factorizations of fully-commu\-tative 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 Monical, Pechenik and Scrimshaw. 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.more » « less
- 
            We introduce a type A crystal structure on decreasing factorizations on 321-avoiding elements in the 0-Hecke monoid which we call *-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 *-crystal intertwines with the crystal on set-valued tableaux recently introduced by Monical, Pechenik and Scrimshaw. 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.more » « less
- 
            We provide a characterization of the crystal bases for the quantum queer superalgebra recently introduced by Grantcharov et al. This characterization is a combination of local queer axioms generalizing Stembridge’s local axioms for crystal bases for simply-laced root systems, which were recently introduced by Assaf and Oguz, with further axioms and a new graph G characterizing the relations of the type A components of the queer crystal. We provide a counterexample to Assaf’s and Oguz’ conjecture that the local queer axioms uniquely characterize the queer supercrystal. We obtain a combinatorial description of the graph G on the type A components by providing explicit combinatorial rules for the odd queer operators on certain highest weight elements.more » « less
- 
            We introduce a type A crystal structure on decreasing factorizations on 321-avoiding elements in the 0-Hecke monoid which we call *-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 *-crystal intertwines with the crystal on set-valued tableaux recently introduced by Monical, Pechenik and Scrimshaw. 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.more » « less
 An official website of the United States government
An official website of the United States government 
				
			 
					 
					
 
                                     Full Text Available
                                                Full Text Available