Abstract. For pi ∈ Sn, let d(pi) be the arithmetic average of {|i − pi(i)|; 1 ≤ i ≤ n}. Then 0 ≤ d(pi)/n ≤ 1/2, the expected value of d(pi)/n approaches 1/3 as n approaches infinity, and most permutations have d(pi)/n close to 1/3. We also describe all permutations with d(pi)/n = 1/2. Let s+(pi) and s∗(pi) be the arithmetic and geometric averages of {|pi(i) − pi(i + 1)|; 1 ≤ i < n}, respectively. Let M+, M ∗ be the maxima of s+ and s ∗ over Sn, respectively. Then M+ = (2m2 − 1)/(2m − 1) when n = 2m, M+ = (2m2 + 2m − 1)/(2m) when n = 2m + 1, M ∗ = (mm(m + 1)m−1)1/(n−1) when n = 2m, and M ∗ = (mm(m + 1)(m + 2)m−1)1/(n−1) when n = 2m + 1> 1. We also describe all permutations pi, σ with s+(pi) =M+, s∗(σ) =M∗. 1. Motivation an
International audienceThe additive x-disorder of a permutation is the sum of the absolute difference...
AbstractLet σ∈Sk and τ∈Sn be permutations. We say τ contains σ if there exist 1⩽x1<x2<…<xk⩽n such th...
The major index is a well-known statistic on permutations which is computed by summing the positions...
An interval of a permutation is a consecutive substring consisting of consecutive symbols. For examp...
n≥0Sn. For pi, σ ∈ S, we say that σ contains pi if there is a subsequence of σ having the same relat...
The set of cycle lengths of almost all permutations in Sn are “Poisson dis-tributed”: we show that t...
Heber S, Mayr R, Stoye J. Common Intervals of Multiple Permutations. Algorithmica. 2011;60(2):175-20...
Abstract. For non-negative integers r + s = n − 1, let [bras] denote the number of permutations pi ∈...
The existence of a small partition of a combinatorial structure into random-like subparts, a so-call...
We prove that the set of growth rates of permutation classes includes an infinite sequence of interv...
Let [n] = {1, 2, 3,..., n} be the set of the first n positive integers. A permutation π is a biject...
For each permutation pi we introduce the variation statistic of pi, as the total number of elements ...
To detect patterns in the transcendental number pi, we can use the following formula : r{Ξ, Π, Ρ, Σ...
AbstractHow much can a permutation be simplified by means of cyclic rotations? For functions f:Sn → ...
We study statistical properties of the random variables Xσ(pi), the number of occurrences of the pat...
International audienceThe additive x-disorder of a permutation is the sum of the absolute difference...
AbstractLet σ∈Sk and τ∈Sn be permutations. We say τ contains σ if there exist 1⩽x1<x2<…<xk⩽n such th...
The major index is a well-known statistic on permutations which is computed by summing the positions...
An interval of a permutation is a consecutive substring consisting of consecutive symbols. For examp...
n≥0Sn. For pi, σ ∈ S, we say that σ contains pi if there is a subsequence of σ having the same relat...
The set of cycle lengths of almost all permutations in Sn are “Poisson dis-tributed”: we show that t...
Heber S, Mayr R, Stoye J. Common Intervals of Multiple Permutations. Algorithmica. 2011;60(2):175-20...
Abstract. For non-negative integers r + s = n − 1, let [bras] denote the number of permutations pi ∈...
The existence of a small partition of a combinatorial structure into random-like subparts, a so-call...
We prove that the set of growth rates of permutation classes includes an infinite sequence of interv...
Let [n] = {1, 2, 3,..., n} be the set of the first n positive integers. A permutation π is a biject...
For each permutation pi we introduce the variation statistic of pi, as the total number of elements ...
To detect patterns in the transcendental number pi, we can use the following formula : r{Ξ, Π, Ρ, Σ...
AbstractHow much can a permutation be simplified by means of cyclic rotations? For functions f:Sn → ...
We study statistical properties of the random variables Xσ(pi), the number of occurrences of the pat...
International audienceThe additive x-disorder of a permutation is the sum of the absolute difference...
AbstractLet σ∈Sk and τ∈Sn be permutations. We say τ contains σ if there exist 1⩽x1<x2<…<xk⩽n such th...
The major index is a well-known statistic on permutations which is computed by summing the positions...