Related papers: Mahonian STAT on words
General permutation invariant statistics in the second quantized approach are considered. Simple interpolations between dual statistics are constructed. Particularly, we present a new minimal interpolation between parabosons and…
It is well-known, and was first established by Knuth in 1969, that the number of 321-avoiding permutations is equal to that of 132-avoiding permutations. In the literature one can find many subsequent bijective proofs of this fact. It turns…
In 2015, Brosnan and Chow, and independently Guay-Paquet, proved the Shareshian-Wachs conjecture, which links the Stanley-Stembridge conjecture in combinatorics to the geometry of Hessenberg varieties through Tymoczko's permutation group…
The development of the theories of the second-order Eulerian polynomials began with the works of Buckholtz and Carlitz in their studies of an asymptotic expansion. Gessel-Stanley introduced Stirling permutations and presented combinatorial…
Recently, Sagan and Savage introduced the notion of Eulerian pairs. In this note, we find Eulerian pairs on Fibonacci words based on Foata's first transformation or Han's bijection and a map in the spirit of a bijection of…
Given a general multiset $\mathcal{M}=\{1^{m_1},2^{m_2},\ldots,n^{m_n}\}$, where $i$ appears $m_i$ times, a multipermutation $\pi$ of $\mathcal{M}$ is called {\em quasi-Stirling}, if it contains no subword of the form $abab$ with $a\neq b$.…
Recently, Babson and Steingrimsson (see \cite{BS}) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Following \cite{BCS}, let $e_k\pi$…
We present a bijection between permutation matrices and descending plane partitions without special parts, which respects the quadruple of statistics considered by Behrend, Di Francesco and Zinn--Justin. This bijection involves the…
We derive some new signed Mahonian polynomials over the complex reflection group $G(r,1,n)=C_r\wr\mathfrak{S}_n$, where the "sign" is taken to be any of the $2r$ $1$-dim characters and the "Mahonian" statistics are the $\mathsf{lmaj}$…
It is known that, when $n$ is even, the number of permutations of $\{1,2,\dots,n\}$ all of whose cycles have odd length equals the number of those all of whose cycles have even length. Adin, Heged\H{u}s and Roichman recently found a…
Arnold & Manjunath (2021) claim that the bivariate pseudo-Poisson distribution is well suited to bivariate count data with one equidispersed and one overdispersed marginal, owing to its parsimonious structure and straightforward parameter…
We prove that the Mahonian-Stirling pairs of permutation statistics $(\sor, \cyc)$ and $(\inv, \mathrm{rlmin})$ are equidistributed on the set of permutations that correspond to arrangements of $n$ non-atacking rooks on a Ferrers board with…
We study the stability of posterior predictive inferences to the specification of the likelihood model and perturbations of the data generating process. In modern big data analyses, useful broad structural judgements may be elicited from…
Construction grammar posits that constructions, or form-meaning pairings, are acquired through experience with language (the distributional learning hypothesis). But how much information about constructions does this distribution actually…
We present a method, illustrated by several examples, to find explicit counts of permutations containing a given multiset of three letter patterns. The method is recursive, depending on bijections to reduce to the case of a smaller…
Starting with a combinatorial partition theorem for words over an infinite alphabet dominated by a fixed sequence, established recently by the authors, we prove recurrence results for topological dynamical systems indexed by such words. In…
Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…
The framework of Stein's method for Poisson process approximation is presented from the point of view of Palm theory, which is used to construct Stein identities and define local dependence. A general result (Theorem…
Enumeration problems related to words avoiding patterns as well as permutations that contain the pattern $123$ exactly once have been studied in great detail. However, the problem of enumerating words that contain the pattern $123$ exactly…
Let $w$ be a word in a free group. As was revealed by Magee and Puder in [arXiv:1802.04862], the stable commutator length (scl) of $w$, a well-known topological invariant, can also be defined in terms of certain stable Fourier coefficients…