Related papers: Mahonian Statistics and Vincular Patterns on Permu…
We say that a permutation $\pi$ is a Motzkin permutation if it avoids 132 and there do not exist $a<b$ such that $\pi_a<\pi_b<\pi_{b+1}$. We study the distribution of several statistics in Motzkin permutations, including the length of the…
Br\"and\'en and Claesson introduced mesh patterns to provide explicit expansions for certain permutation statistics as linear combinations of (classical) permutation patterns. The first systematic study of avoidance of mesh patterns was…
The study of pattern avoidance in permutations, and specifically in flattened partitions is an active area of current research. In this paper, we count the number of distinct flattened partitions over [n] avoiding a single pattern, as well…
We relate properties of weighted flags (or multiflags) of type AD to statistics of the corresponding Weyl groups. For type A, we recover the Mahonian statistics on symmetric groups. Finally, we sketch briefly an easy extension incorporating…
Three specializations of a set of orthogonal polynomials with ``8 different q's'' are given. The polynomials are identified as $q$-analogues of Laguerre polynomials, and the combinatorial interpretation of the moments give infinitely many…
In the context of Stirling polynomials, Gessel and Stanley introduced the definition of Stirling permutation, which has attracted extensive attention over the past decades. Recently, we introduced Stirling permutation code and provided…
Asymptotics of the normalizing constant is computed for a class of one parameter exponential families on permutations which includes Mallows model with Spearmans's Footrule and Spearman's Rank Correlation Statistic. The MLE, and a…
We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting…
Bayesian methods have proven themselves to be successful across a wide range of scientific problems and have many well-documented advantages over competing methods. However, these methods run into difficulties for two major and prevalent…
We study the length of the longest increasing and longest decreasing subsequences of random permutations drawn from the Mallows measure. Under this measure, the probability of a permutation pi in S_n is proportional to q^{inv(pi)} where q…
This article is concerned with the fitting of multinomial regression models using the so-called "Poisson Trick". The work is motivated by Chen & Kuo (2001) and Malchow-M{\o}ller & Svarer (2003) which have been criticized for being…
Given a distribution in the unite square and having iid sample from it the first question what a statistician might do to test the hypothesis that the sample is iid. For this purpose an extension of the Plancherel measure is introduced.…
Markov combination is an operation that takes two statistical models and produces a third whose marginal distributions include those of the original models. Building upon and extending existing work in the Gaussian case, we develop Markov…
A four-variable distribution on permutations is derived, with two dual combinatorial interpretations. The first one includes the number of fixed points "fix", the second the so-called "pix" statistic. This shows that the duality between…
We define and study multiplicative connections in the tangent bundle of a Lie groupoid. Multiplicative connections are linear connections satisfying an appropriate compatibility with the groupoid structure. Our definition is natural in the…
A symmetry of $(t,q)$-Eulerian numbers of type $B$ is combinatorially proved by defining an involution preserving many important statistics on the set of permutation tableaux of type $B$. This involution also proves a symmetry of the…
This work concerns the proof theory of (left) skew monoidal categories and their variants (e.g. closed monoidal, symmetric monoidal), continuing the line of work initiated in recent years by Uustalu et al. Skew monoidal categories are a…
This paper considers the problem of sequential fusion of predictions from neural networks (NN) and fusion of predictions from multiple NN. This fusion strategy increases the robustness, i.e., reduces the impact of one incorrect…
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…
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…