Related papers: On the excedance number of colored permutation gro…
In this paper, we introduce a convergence notion for ordered selections. Our convergence notion is based on subpermutation densities and convergences of the marginal distributions. A particular case of this convergence is the well-known…
The equidistribution of many crossing and nesting statistics exists in several combinatorial objects like matchings, set partitions, permutations, and embedded labelled graphs. The involutions switching nesting and crossing numbers for set…
The derangement polynomial for the symmetric group enumerates derangements by the number of excedances. It can be interpreted as the local $h$-polynomial, in the sense of Stanley, of the barycentric subdivision of the simplex. Motivated by…
In this paper we study the determinant of irreducible representations of the generalized symmetric groups $\mathbb{Z}_r \wr S_n$. We give an explicit formula to compute the determinant of an irreducible representation of $\mathbb{Z}_r \wr…
We introduce a new statistic on the hyperoctahedral groups (Coxeter groups of type B), and give a conjectural formula for its signed distributions over arbitrary descent classes. The statistic is analogous to the classical Coxeter length…
Linear second order recursive sequences with arbitrary initial conditions are studied. For sequences with the same parameters a ring and a group is attached, and isomorphisms and homomorphisms are established for related parameters. In the…
We establish a "diagonal" ergodic theorem involving the additive and multiplicative groups of a countable field $K$ and, with the help of a new variant of Furstenberg's correspondence principle, prove that any "large" set in $K$ contains…
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…
We explore a bijection between permutations and colored Motzkin paths that has been used in different forms by Foata and Zeilberger, Biane, and Corteel. By giving a visual representation of this bijection in terms of so-called cycle…
Andr\'e proved that the number of alternating permutations on $\{1, 2, \dots, n\}$ is equal to the Euler number $E_n$. A refinement of Andr\'e's result was given by Entringer, who proved that counting alternating permutations according to…
The extension of majorization (also called the rearrangement ordering), to more general groups than the symmetric (permutation) group, is referred to as $G$-majorization. There are strong results in the case that $G$ is a reflection group…
We determine precisely when the branching coefficients arising from the restriction of irreducible representations of the symmetric group $S_n$ to the dihedral subgroup $D_n$ are nonzero, and we establish uniform linear lower bounds outside…
Erd\H{o}s and Hajnal constructed a 4-coloring of the triples of an $N$-element set such that every $n$-element subset contains 2 triples with distinct colors, and $N$ is double exponential in $n$. Conlon, Fox and R\"odl asked whether there…
Let $q$ be an odd prime power and let $X(m,q)$ be the set of symmetric bilinear forms on an $m$-dimensional vector space over $\mathbb{F}_q$. The partition of $X(m,q)$ induced by the action of the general linear group gives rise to a…
We provide asymptotic theory for the joint distribution of $X_{\mathrm{inv}}$ and $X_{\mathrm{des}}$, the numbers of inversions and descents of random permutations. Recently, D\"orr & Kahle (2022) proved that $X_{\mathrm{inv}}$,…
We prove several general formulas for the distributions of various permutation statistics over any set of permutations whose quasisymmetric generating function is a symmetric function. Our formulas involve certain kinds of plethystic…
K\H{o}nig's edge-coloring theorem for bipartite graphs and Vizing's edge-coloring theorem for general graphs are celebrated results in graph theory and combinatorial optimization. Schrijver generalized K\H{o}nig's theorem to a framework…
Let $X_1, X_2,\ldots, X_n$ (resp. $Y_1, Y_2,\ldots, Y_n$) be independent random variables such that $X_i$ (resp. $Y_i$) follows generalized exponential distribution with shape parameter $\theta_i$ and scale parameter $\lambda_i$ (resp.…
We show that double cosets of the infinite symmetric group with respect to some special subgroups admit natural structures of semigroups. We interpret elements of such semigroups in combinatorial terms (chips, colored graphs,…
We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…