AbstractA permutation sequence (σn)n∈N is said to be convergent if, for every fixed permutation τ, the density of occurrences of τ in the elements of the sequence converges. We prove that such a convergent sequence has a natural limit object, namely a Lebesgue measurable function Z:[0,1]2→[0,1] with the additional properties that, for every fixed x∈[0,1], the restriction Z(x,⋅) is a cumulative distribution function and, for every y∈[0,1], the restriction Z(⋅,y) satisfies a “mass” condition. This limit process is well-behaved: every function in the class of limit objects is a limit of some permutation sequence, and two of these functions are limits of the same sequence if and only if they are equal almost everywhere. An ingredient in the pro...
73 pages, 17 figuresInternational audienceWe consider uniform random permutations in proper substitu...
73 pages, 17 figuresInternational audienceWe consider uniform random permutations in proper substitu...
73 pages, 17 figuresInternational audienceWe consider uniform random permutations in proper substitu...
AbstractA permutation sequence (σn)n∈N is said to be convergent if, for every fixed permutation τ, t...
Nesta tese, introduzimos o conceito de sequência convergente de permutações e provamos a existência ...
We give central and local limit theorems for the number of excedances of a uniformly distributed ran...
We give central and local limit theorems for the number of excedances of a uniformly distributed ran...
We give central and local limit theorems for the number of excedances of a uniformly distributed ran...
We consider uniform random permutations in proper substitution-closed classes and study their limiti...
We consider uniform random permutations in proper substitution-closed classes and study their limiti...
This note gives a central limit theorem for the length of the longest subsequence of a rand...
Abstract. We consider a random permutation drawn from the set of 132-avoiding permutations of length...
Abstract. We consider a random permutation drawn from the set of 132-avoiding permutations of length...
73 pages, 17 figuresInternational audienceWe consider uniform random permutations in proper substitu...
73 pages, 17 figuresInternational audienceWe consider uniform random permutations in proper substitu...
73 pages, 17 figuresInternational audienceWe consider uniform random permutations in proper substitu...
73 pages, 17 figuresInternational audienceWe consider uniform random permutations in proper substitu...
73 pages, 17 figuresInternational audienceWe consider uniform random permutations in proper substitu...
AbstractA permutation sequence (σn)n∈N is said to be convergent if, for every fixed permutation τ, t...
Nesta tese, introduzimos o conceito de sequência convergente de permutações e provamos a existência ...
We give central and local limit theorems for the number of excedances of a uniformly distributed ran...
We give central and local limit theorems for the number of excedances of a uniformly distributed ran...
We give central and local limit theorems for the number of excedances of a uniformly distributed ran...
We consider uniform random permutations in proper substitution-closed classes and study their limiti...
We consider uniform random permutations in proper substitution-closed classes and study their limiti...
This note gives a central limit theorem for the length of the longest subsequence of a rand...
Abstract. We consider a random permutation drawn from the set of 132-avoiding permutations of length...
Abstract. We consider a random permutation drawn from the set of 132-avoiding permutations of length...
73 pages, 17 figuresInternational audienceWe consider uniform random permutations in proper substitu...
73 pages, 17 figuresInternational audienceWe consider uniform random permutations in proper substitu...
73 pages, 17 figuresInternational audienceWe consider uniform random permutations in proper substitu...
73 pages, 17 figuresInternational audienceWe consider uniform random permutations in proper substitu...
73 pages, 17 figuresInternational audienceWe consider uniform random permutations in proper substitu...