相关论文: On a balanced property of derangements
We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $\{1,2,...,n\}$. We determine explicit…
Based on Bona's condition for the balanced property of the number of cycles of permutations, we give a general criterion for the balanced property in terms of the generating function of a statistic. We show that the q-derangement numbers…
We find exact and asymptotic formulas for the number of pairs $(p,q)$ of $N$-cycles such that the all cycles of the product $p\cdot q$ have lengths from a given integer set. We then apply these results to prove a surprisingly high lower…
The classical derangement numbers count fixed point-free permutations. In this paper we study the enumeration problem of generalized derangements, when some of the elements are restricted to be in distinct cycles in the cycle decomposition.…
In combinatorics, a derangement is a permutation that has no fixed points. The number of derangements of an n-element set is called the n-th derangement number. In this paper, as natural companions to derangement numbers and degenerate…
A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we…
In combinatorics, a derangement is a permutation of the elements of a set, such that no element appears in its original position. The number of derangement of an n-element set is called the nth derangement number. Recently, the degenerate…
We prove a number of results, new and old, about the cycle type of a random permutation on S_n. Underlying our analysis is the idea that the number of cycles of size k is roughly Poisson distributed with parameter 1/k. In particular, we…
We study the asymptotic behavior of the long cycles of a random permutation of $n$ objects with respect to multiplicative measures with polynomial growing cycle weights. We show that the longest cycle and the length differences between the…
We study the distribution of cycle lengths in models of nonuniform random permutations with cycle weights. We identify several regimes. Depending on the weights, the length of typical cycles grows like the total number $n$ of elements, or a…
Descent polynomials and peak polynomials, which enumerate permutations with given descent and peak sets respectively, have recently received considerable attention. We give several formulas for $q$-analogs of these polynomials which refine…
We derive exact formulas for the proportions of derangements and of derangements of $p$-power order in the affine classical groups $AU_m(q)$, $ASp_{2m}(q)$, $AO_{2m+1}(q)$ and $AO^{\pm}_{2m}(q)$, where $p$ denotes the characteristic of the…
We present a new killing-a-fly-with-a-sledgehammer proof of one of the oldest results in probability which says that the probability that a random permutation on $n$ elements has no fixed points tends to $e^{-1}$ as $n$ tends to infinity.…
We use moment method to understand the cycle structure of the composition of independent invariant permutations. We prove that under a good control on fixed points and cycles of length 2, the limiting joint distribution of the number of…
We determine a set of permutation patterns $q$ so that the number of permutations with $r$ occurrences of $q$ is asymptotically $n^r$ times the number of permutations avoiding $q$, partially settling a conjecture of Conway and Guttman. We…
Picking permutations at random, the expected number of k-cycles is known to be 1/k and is, in particular, independent of the size of the permuted set. This short note gives similar size-independent statistics of finite general linear…
A derangement is a permutation with no fixed point, and a nonderangement is a permutation with at least one fixed point. There is a one-term recurrence for the number of derangements of $n$ elements, and we describe a bijective proof of…
Let $S$ be a finite set of positive integers with largest element $m$. Let us randomly select a composition $a$ of the integer $n$ with parts in $S$, and let $m(a)$ be the multiplicity of $m$ as a part of $a$. Let $0\leq r<q$ be integers,…
The linearization coefficient $\mathcal{L}(L_{n_1}(x)\dots L_{n_k}(x))$ of classical Laguerre polynomials $L_n(x)$ is known to be equal to the number of $(n_1,\dots,n_k)$-derangements, which are permutations with a certain condition.…
We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements $1,2,...,k$ are in distinct cycles of…