Shuffle-compatible permutation statistics
From MaRDI portal
Abstract: Since the early work of Richard Stanley, it has been observed that several permutation statistics have a remarkable property with respect to shuffles of permutations. We formalize this notion of a shuffle-compatible permutation statistic and introduce the shuffle algebra of a shuffle-compatible permutation statistic, which encodes the distribution of the statistic over shuffles of permutations. This paper develops a theory of shuffle-compatibility for descent statistics (statistics that depend only on the descent set and length) which has close connections to the theory of -partitions, quasisymmetric functions, and noncommutative symmetric functions. We use our framework to prove that many descent statistics are shuffle-compatible and to give explicit descriptions of their shuffle algebras, thus unifying past results of Stanley, Gessel, Stembridge, Aguiar-Bergeron-Nyman, and Petersen.
Recommendations
Cites work
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 3895079 (Why is no real title available?)
- A Bijective Proof of Stanley's Shuffling Theorem
- A Mackey formula in the group of a Coxeter group. With an appendix by J. Tits: Two properties of Coxeter complexes
- Algebraic properties for some permutation statistics
- An introduction to quasisymmetric Schur functions. Hopf algebras, quasisymmetric functions, and Young composition tableaux.
- Counting permutations by alternating descents
- Counting permutations by runs
- Dual creation operators and a dendriform algebra structure on the quasisymmetric functions
- Enriched \(P\)-partitions and peak algebras
- Enriched đ-Partitions
- Enumerative combinatorics. Volume 2.
- Eulerian polynomials and descent statistics
- Generating functions for alternating descents and alternating major index
- Noncommutative symmetric functions
- OpÊrations sur l'homologie cyclique des algèbres commutatives. (Operations on the cyclic homology of commutative algebras)
- Ordered structures and partitions
- Permutation patterns and statistics
- Shuffle-compatible permutation statistics. II: The exterior peak set
- Stanley's shuffling theorem revisited
- Subalgebras of Solomon's descent algebra based on alternating runs
- The peak algebra and the descent algebras of types B and D
- The peak algebra of the symmetric group
- The peak algebra of the symmetric group revisited.
- Variations on descents and inversions in permutations
Cited in
(23)- A cyclic analogue of Stanley's shuffling theorem
- Bijective proofs of shuffle compatibility results
- Cyclic shuffle compatibility
- Two generalizations of posets of shuffles
- Plethystic formulas for permutation enumeration
- Cyclic descents for Motzkin paths
- A counterexample to the shuffle compatiblity conjecture
- Shuffle algebras, homology, and consecutive pattern avoidance
- A lifting of the Goulden-Jackson cluster method to the Malvenuto-Reutenauer algebra
- On Denert's statistic
- Cyclic shuffle-compatibility via cyclic shuffle algebras
- A cornucopia of quasi-Yamanouchi tableaux
- Homomorphisms on noncommutative symmetric functions and permutation enumeration
- Shuffle-compatible permutation statistics. II: The exterior peak set
- Shuffle-compatible descent statistics and quotients of quasisymmetric functions
- Descent-inversion statistics in riffle shuffles
- On a conjecture concerning shuffle-compatible permutation statistics
- On kernels of descent statistics
- The enriched \(q\)-monomial basis of the quasisymmetric functions
- Refined consecutive pattern enumeration via a generalized cluster method
- Enriched toric \([\vec{D}]\)-partitions
- Some refinements of Stanley's shuffle theorem
- Fibonacci numbers, consecutive patterns, and inverse peaks
This page was built for publication: Shuffle-compatible permutation statistics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1639637)
