Related papers: Cyclic shuffle-compatibility via cyclic shuffle al…
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…
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…
Define a permutation to be any sequence of distinct positive integers. Given two permutations p and s on disjoint underlying sets, we denote by p sh s the set of shuffles of p and s (the set of all permutations obtained by interleaving the…
The notion of shuffle-compatible permutation statistics was implicit in Stanley's work on P-partitions and was first explicitly studied by Gessel and Zhuang. The aim of this paper is to prove that the triple ${\rm (udr, pk, des)}$ is…
A permutation statistic is substring-compatible if its value on a permutation determines its value on every substring of that permutation. We construct the substring coalgebra of such a statistic, an analog of the shuffle algebra of a…
The shuffle product has a connection with several useful permutation statistics such as descent and peak, and corresponds to the multiplication operation in the corresponding descent and peak algebras. In their recent work, Gessel and…
This is a continuation of arXiv:1706.00750 by Gessel and Zhuang (but can be read independently from the latter). We study the shuffle-compatibility of permutation statistics -- a concept introduced in arXiv:1706.00750, although various…
We introduce the cyclic major index of a cycle permutation and give a bivariate analogue of enumerative formula for the cyclic shuffles with a given cyclic descent numbers due to Adin, Gessel, Reiner and Roichman, which can be viewed as a…
Given a permutation statistic $\operatorname{st}$, define its inverse statistic $\operatorname{ist}$ by $\operatorname{ist}(\pi):=\operatorname{st}(\pi^{-1})$. We give a general approach, based on the theory of symmetric functions, for…
The ring of cyclic quasi-symmetric functions and its non-Escher subring are introduced in this paper. A natural basis consists of fundamental cyclic quasi-symmetric functions; for the non-Escher subring they arise as toric $P$-partition…
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…
We construct a non-commutative, non-cocommutative, graded bialgebra $\mathbf{\Pi}$ with a basis indexed by the permutations in all finite symmetric groups. Unlike the formally similar Malvenuto-Poirier-Reutenauer Hopf algebra, this…
In 2020, Bloom and Sagan defined subsets of the symmetric group $\mathfrak{S}_n$ called partial shuffles, and proved a formula for the Schur expansion of the pattern quasisymmetric function associated with a partial shuffle. In their proof,…
Using symmetric function theory, we study the cycle structure and increasing subsequence structure of permutations after various shuffling methods, emphasizing the role of Cauchy type identities and the Robinson-Schensted-Knuth…
A large family of relations among multiple zeta values may be described using the combinatorics of shuffle and quasi-shuffle algebras. While the structure of shuffle algebras have been well understood for some time now, quasi-shuffle…
We study a family of shuffling operators on the symmetric group $S_n$, which includes the top-to-random shuffle. The general shuffling scheme consists of removing one card at a time from the deck (according to some probability distribution)…
A permutation $\sigma$ of a multiset is called Stirling permutation if $\sigma(s)\ge \sigma(i)$ as soon as $\sigma(i)=\sigma(j)$ and $i<s<j.$ In our paper we study Stirling polynomials that arise in the generating function for descent…
A permutation $\pi$ of a multiset is said to be a {\em quasi-Stirling } permutation if there does not exist four indices $i<j<k<\ell$ such that $\pi_i=\pi_k$ and $\pi_j=\pi_{\ell}$. Define $$ \overline{Q}_{\mathcal{M}}(t,u,v)=\sum_{\pi\in…
Over the past years, major attention has been drawn to the question of identifying Schur-positive sets, i.e. sets of permutations whose associated quasisymmetric function is symmetric and can be written as a non-negative sum of Schur…