Related papers: Refined Wilf-equivalences by Comtet statistics
Two permutation classes, the X-class and subpermutations of the increasing oscillation are shown to exhibit an exponential Wilf-collapse. This means that the number of distinct enumerations of principal subclasses of each of these classes…
Visontai conjectured in 2013 that the joint distribution of ascent and distinct nonzero value numbers on the set of subexcedant sequences is the same as that of descent and inverse descent numbers on the set of permutations. This conjecture…
The main theme of this paper is the enumeration of the occurrence of a pattern in words and permutations. We mainly focus on asymptotic properties of the sequence $f_r^v(k,n),$ the number of $n$-array $k$-ary words that contain a given…
Given a permutation $\tau$ defined on a set of combinatorial objects $S$, together with some statistic $f:S\rightarrow \mathbb{R}$, we say that the triple $\langle S, \tau,f \rangle$ exhibits homomesy if $f$ has the same average along all…
The G-Wishart distribution is an essential component for the Bayesian analysis of Gaussian graphical models as the conjugate prior for the precision matrix. Evaluating the marginal likelihood of such models usually requires computing…
We study $q$-analogues of $k$-Fibonacci numbers that arise from weighted tilings of an $n\times1$ board with tiles of length at most $k$. The weights on our tilings arise naturally out of distributions of permutations statistics and set…
Jel\'inek, Mansour, and Shattuck studied Wilf-equivalence among pairs of patterns of the form $\{\sigma,\tau\}$ where $\sigma$ is a set partition of size $3$ with at least two blocks. They obtained an upper bound for the number of…
In 2012 B\'ona showed the rather surprising fact that the cumulative number of occurrences of the classical patterns $231$ and $213$ are the same on the set of permutations avoiding $132$, beside the pattern based statistics $231$ and $213$…
We study $q$-Whittaker polynomials and their monomial expansions given by the fermionic formula, the inv statistic of Haglund-Haiman-Loehr and the quinv statistic of Ayyer-Mandelshtam-Martin. The combinatorial models underlying these…
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,…
Permutation tableaux are combinatorial objects related with permutations and various statistics on them. They appeared in connection with total positivity in Grassmannians, and stationary probabilities in a PASEP model. In particular they…
Any reasonable measure of distinguishability of quantum states must satisfy a data processing inequality, that is, it must not increase under the action of a quantum channel. We can ask about the proportion of information lost or preserved…
A conjecture by Deutsch, Kitaev, and Remmel states that the triples of permutation statistics $(S_{10}, S_{12}, S_{17})$ and $(S_{12}, S_{10} ,S_{17})$ are equidistributed over the symmetric group $\mathfrak{S}_n$. Here, $S_{10}$ enumerates…
Permutation statistics $\wnm$ and $\rlm$ are both arising from permutation tableaux. $\wnm$ was introduced by Chen and Zhou, which was proved equally distributed with the number of unrestricted rows of a permutation tableau. While $\rlm$ is…
Compositional data arise when count observations are normalised into proportions adding up to unity. To allow use of standard statistical methods, compositional proportions can be mapped from the simplex into the Euclidean space through the…
In a recent paper, Backelin, West and Xin describe a map $\phi ^*$ that recursively replaces all occurrences of the pattern $k... 21$ in a permutation $\sigma$ by occurrences of the pattern $(k-1)... 21 k$. The resulting permutation…
After reviewing a large body of literature on the modeling of bivariate discrete distributions with finite support, \cite{Gee20} made a compelling case for the use of $I$-projections in the sense of \cite{Csi75} as a sound way to attempt to…
We review a finite-sampling exponential bound due to Serfling and discuss related exponential bounds for the hypergeometric distribution. We then discuss how such bounds motivate some new results for two-sample empirical processes. Our…
Super-strong (elsewhere referred to as strong) Wilf equivalence is a type of Wilf equivalence on words that was introduced by Kitaev et al. in 2009. We provide a necessary and sufficient condition for two permutations in $n$ letters to be…
We have made a systematic numerical study of the 16 Wilf classes of length-5 classical pattern-avoiding permutations from their generating function coefficients. We have extended the number of known coefficients in fourteen of the sixteen…