Cyclic shuffle compatibility

zbMATH Open1505.05003arXiv2106.10182MaRDI QIDQ2099397FDOQ2099397

Authors: Rachel Domagalski, Jinting Liang, Quinn Minnich, Bruce E. Sagan, Jamie Schmidt, Alexander Sietsema 

Publication date: 23 November 2022

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Abstract: Consider a permutation p to be any finite list of distinct positive integers. A statistic is a function St whose domain is all permutations. Let S(p,q) be the set of shuffles of two disjoint permutations p and q. We say that St is shuffle compatible if the distribution of St over S(p,q) depends only on St(p), St(q), and the lengths of p and q. This notion is implicit in Stanley's work on P-partitions and was first explicitly studied by Gessel and Zhuang. One of the places where shuffles are useful is in describing the product in the algebra of quasisymmetric functions. Recently Adin, Gessel, Reiner, and Roichman defined an algebra of cyclic quasisymmetric functions where a cyclic version of shuffling comes into play. The purpose of this paper is to define and study cyclic shuffle compatibility. In particular, we show how one can lift shuffle compatibility results for (linear) permutations to cyclic ones. We then apply this result to cyclic descents and cyclic peaks. We also discuss the problem of finding a cyclic analogue of the major index.

Full work available at URL: https://arxiv.org/abs/2106.10182

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Shuffle-compatible permutation statistics
• Shuffle-compatible descent statistics and quotients of quasisymmetric functions
• Bijective proofs of shuffle compatibility results
• A cyclic analogue of Stanley's shuffling theorem
• A counterexample to the shuffle compatiblity conjecture

zbMATH Keywords

descentpeakcyclic permutationshuffle compatible

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Cites Work

• Title not available (Why is that?)
• An introduction to quasisymmetric Schur functions. Hopf algebras, quasisymmetric functions, and Young composition tableaux.
• Ordered structures and partitions
• Patterns in colored circular permutations
• Shuffle-compatible permutation statistics
• Shuffle-compatible permutation statistics. II: The exterior peak set
• Bijective proofs of shuffle compatibility results
• Cyclic quasi-symmetric functions
• Cyclic pattern containment and avoidance
• Combinatorics: The Art of Counting
• Title not available (Why is that?)

Cited In (4)

• On kernels of descent statistics
• Pinnacle set properties
• Some refinements of Stanley's shuffle theorem
• A cyclic analogue of Stanley's shuffling theorem

This page was built for publication: Cyclic shuffle compatibility

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099397)