Related papers: The enumeration of simple permutations
We introduce the notion of crossings and nestings of a permutation. We compute the generating function of permutations with a fixed number of weak exceedances, crossings and nestings. We link alignments and permutation patterns to these…
The interval poset of a permutation catalogues the intervals that appear in its one-line notation, according to set inclusion. We study this poset, describing its structural, characterizing, and enumerative properties.
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…
A record in a permutation is a maximum or a minimum, from the left or from the right. The entries of a permutation can be partitioned into two types: the ones that are records are called external points, the others are called internal…
We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these…
We recover Gessel's determinantal formula for the generating function of permutations with no ascending subsequence of length m+1. The starting point of our proof is the recursive construction of these permutations by insertion of the…
We study the distribution of the number of permutations with a given periodic up-down sequence w.r.t. the last entry, find exponential generating functions and prove asymptotic formulas for this distribution.
A permutation P on {1,..,N} is a_fast_forward_permutation_ if for each m the computational complexity of evaluating P^m(x)$ is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions.…
We present an easily defined countable family of permutations of the natural numbers for which explicit rearrangements (i.e., the sums induced by the permutations) can be computed. The digamma function proves to be the key tool for the…
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…
In this short note we present a simple combinatorial trick which can be effectively applied to show the non--existence of sharply transitive sets of permutations in certain finite permutation groups.
In this paper, we focus on the enumeration of permutations by number of cyclic occurrence of peaks and valleys. We find several recurrence relations involving the number of permutations with a prescribed number of cyclic peaks, cyclic…
We give a generating function for the number of unimodal permutations with a given cycle structure.
A ballot permutation is a permutation {\pi} such that in any prefix of {\pi} the descent number is not more than the ascent number. In this article, we obtained a formula in close form for the multivariate generating function of {A(n,d,j)},…
There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…
We introduce and study a simple Markovian model of random separable permutations. Our first main result is the almost sure convergence of these permutations towards a random limiting object in the sense of permutons, which we call the…
Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given…
Permutons are probability measures on the unit square with uniform marginals that provide a natural way to describe limits of permutations. We are interested in the permuton limits for permutations sampled uniformly from certain…
An infinite permutation is a linear ordering of the set of natural numbers. An infinite permutation can be defined by a sequence of real numbers where only the order of elements is taken into account. In the paper we investigate a new class…
We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…