Related papers: Fixed points and cycle structure of random permuta…
A permutation sequence is said to be convergent if the density of occurrences of every fixed permutation in the elements of the sequence converges. We prove that such a convergent sequence has a natural limit object, namely a Lebesgue…
We study limit shapes in two equivalent models: the six-vertex model in the $c\to0$ limit and the random Mallows permutation with restricted permutation matrix. We give the Euler-Lagrange equation for the limit shape and show how to solve…
This paper establishes novel fixed point theorems for Kannan-type and Chatterjea-type mappings in probabilistic cone metric spaces. By integrating probabilistic distance functions with cone-valued structures, we generalize classical fixed…
The extension of pattern avoidance from ordinary permutations to those on multisets gave birth to several interesting enumerative results. We study permutations on regular multisets, i.e., multisets in which each element occurs the same…
The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…
A block cipher is intended to be computationally indistinguishable from a random permutation of appropriate domain and range. But what are the properties of a random permutation? By the aid of exponential and ordinary generating functions,…
We study the limiting behavior of smooth linear statistics of the spectrum of random permutation matrices in the mesoscopic regime, when the permutation follows one of the Ewens measures on the symmetric group. If we apply a smooth enough…
We introduce a new class of large structured random matrices characterized by four fundamental properties which we discuss. We prove that this class is stable under matrix-valued and pointwise non-linear operations. We then formulate an…
In "Random complex fewnomials, I," B. Shiffman and S. Zelditch determine the limiting formula as N goes to infinity of the (normalized) expected distribution of complex zeros of a system of k random n-nomials in m variables where the…
A general explicit upper bound is obtained for the proportion $P(n,m)$ of elements of order dividing $m$, where $n-1 \le m \le cn$ for some constant $c$, in the finite symmetric group $S_n$. This is used to find lower bounds for the…
In this paper we study the inverse of so-called unfair permutations, and explore various properties of them. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave…
Kingman's model describes the evolution of a one-locus haploid population of infinite size and discrete generations under the competition of selection and mutation. A random generalisation has been made in a previous paper which assumes all…
Which combinatorial sequences correspond to moments of probability measures on the real line? We present a generating function, in the form of a continued fraction, for a fourteen-parameter family of such sequences and interpret these in…
The Mallows measure on the symmetric group $S_n$ is the probability measure such that each permutation has probability proportional to $q$ raised to the power of the number of inversions, where $q$ is a positive parameter and the number of…
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
We discuss both simple and more subtle connections between the numbers of permutations and full cycles with some restrictions,in particular, between the numbers of permutations and full cycles with prescribed up-down structure.
In this paper we introduce an interlacing condition on the elements of a family of operators that allows us to gather together a number of results on fixed points and common fixed points for single and families of mappings defined on metric…
We give two simple proofs of a conjecture of Richard Stanley concerning the equidistribution of derangements and alternating permutations with the maximal number of fixed points.
In this paper we define the closure under weak convergence of the class of p-tempered {\alpha}-stable distributions. We give necessary and sufficient conditions for convergence of sequences in this class. Moreover, we show that any element…