We present a point of view on consecutive permutation patterns that interprets these in terms of (1) natural generalizations of the descent set of a permutation, (2) paths of a $k$-dependent point process, (3) refined clusters in the cluster method, and, surprisingly, (4) as conjectured moments of probability measures on the real line. At the heart of this paper is a recursive enumeration formula that allows us to get a grip on the aforementioned quantities and further enables us to formulate and numerically verify the conjecture (4), which provides a new unifying perspective on moment sequences arising from the study of permutation patterns
For permutations avoiding consecutive patterns from a given set, we present a combinatorial formula ...
Goulden and Jackson introduced a very powerful method to study the distributions ofcertain consecuti...
AMS Subject Classication: 05A05 Abstract. The old workhorse called linearity of expectation, by whic...
We present a point of view on consecutive permutation patterns that interprets these in terms of (1)...
Which combinatorial sequences correspond to moments of probability measures on the real line? We pre...
AbstractWe exploit Krattenthaler’s bijection between the set Sn(3-1-2) of permutations in Sn avoidin...
We use the cluster method in order to enumerate permutations avoiding consecutive patterns. We repro...
The study of permutations and permutation statistics dates back hundreds of years to the time of Eul...
AbstractWe use the cluster method to enumerate permutations avoiding consecutive patterns. We reprov...
A small subset of combinatorial sequences have coefficients that can be represented as moments of a ...
none3We exploit Krattenthaler’s bijection between the set Sn(3-1-2) of permutations in Sn avoiding t...
We expose the ties between the consecutive pattern enumeration problems as sociated with permutation...
We review a recent development at the interface between discrete mathematics on one hand and probabi...
Given two permutations sigma (of length k) and pi (of length n), the permutation pi is said to conta...
AbstractMotivated by a new point of view to study occurrences of consecutive patterns in permutation...
For permutations avoiding consecutive patterns from a given set, we present a combinatorial formula ...
Goulden and Jackson introduced a very powerful method to study the distributions ofcertain consecuti...
AMS Subject Classication: 05A05 Abstract. The old workhorse called linearity of expectation, by whic...
We present a point of view on consecutive permutation patterns that interprets these in terms of (1)...
Which combinatorial sequences correspond to moments of probability measures on the real line? We pre...
AbstractWe exploit Krattenthaler’s bijection between the set Sn(3-1-2) of permutations in Sn avoidin...
We use the cluster method in order to enumerate permutations avoiding consecutive patterns. We repro...
The study of permutations and permutation statistics dates back hundreds of years to the time of Eul...
AbstractWe use the cluster method to enumerate permutations avoiding consecutive patterns. We reprov...
A small subset of combinatorial sequences have coefficients that can be represented as moments of a ...
none3We exploit Krattenthaler’s bijection between the set Sn(3-1-2) of permutations in Sn avoiding t...
We expose the ties between the consecutive pattern enumeration problems as sociated with permutation...
We review a recent development at the interface between discrete mathematics on one hand and probabi...
Given two permutations sigma (of length k) and pi (of length n), the permutation pi is said to conta...
AbstractMotivated by a new point of view to study occurrences of consecutive patterns in permutation...
For permutations avoiding consecutive patterns from a given set, we present a combinatorial formula ...
Goulden and Jackson introduced a very powerful method to study the distributions ofcertain consecuti...
AMS Subject Classication: 05A05 Abstract. The old workhorse called linearity of expectation, by whic...