Related papers: Characterization of quasirandom permutations by a …

Drawing on a problem posed by Hertzsprung in 1887, we say that a given permutation $\pi\in\mathcal{S}_n$ contains the Hertzsprung pattern $\sigma\in\mathcal{S}_k$ if there is factor $\pi(d+1)\pi(d+2)\cdots\pi(d+k)$ of $\pi$ such that…

We derive conditions under which random sequences of polarizations (two-point symmetrizations) converge almost surely to the symmetric decreasing rearrangement. The parameters for the polarizations are independent random variables whose…

We explore how the asymptotic structure of a random permutation of $[n]$ with $m$ inversions evolves, as $m$ increases, establishing thresholds for the appearance and disappearance of any classical, consecutive or vincular pattern. The…

We prove that a simple random walk on quasi-transitive graphs with the volume growth being faster than any polynomial of degree 4 has a.s. infinitely many cut times, and hence infinitely many cutpoints. This confirms a conjecture raised by…

Which permutations of a probability distribution on integers minimize variance? Let $X$ be a random variable on a set of integers $\{x_1, \dots, x_N\}$ such that $\mathbb{P}(X_i = x_i) = p_i$, $i \in \{1,\dots,N\}$. Let $(p^{(1)}, \dots,…

Let $\mathcal{M}$ be a set with $M$ elements, let $\psi :\mathcal{M}\to\mathcal{M}$ be a bijective involution, and let~$\boldsymbol{\mathcal{X}}_{\psi}$ be the set of sequences $(x_1,\dots,x_M)\in\mathcal{M}^M$ with the property that…

Let $A$ be a set of natural numbers and let $S_{n,A}$ be the set of all permutations of $[n]=\{1,2,...,n\}$ with cycle lengths belonging to $A$. Furthermore, let $\mid A(n)\mid$ denote the cardinality of the set $A(n)=A\cap [n]$. The limit…

We show that in a hierarchical clustering model the low-order statistics of the density and the peculiar velocity fields can all be modelled semianalytically for a given cosmology and an initial density perturbation power spectrum $P(k)$.…

We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size at most $k$. We show that if for some $b \ge i \ge 0$ the shatter function $f_R$ of a set system $([n],R)$ satisfies $f_R(b) < 2^i(b-i+1)$…

In this paper we characterize all the $r$-parameter families of count distributions (satisfying mild conditions) that are closed under addition and under binomial subsampling. Surprisingly, few families satisfy both properties and the…

We extend Friedman's theorem to show that, for any fixed $r>1$, a random $2r$--regular Schreier graph associated with the action of $r$ uniformly random permutations of $[n]$ on $k_{n}$--tuples of distinct elements in $[n]$ has a…

In this article we study in detail a family of random matrix ensembles which are obtained from random permutations matrices (chosen at random according to the Ewens measure of parameter $\theta>0$) by replacing the entries equal to one by…

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…

Let $G_1,\dots, G_m$ be independent identically distributed Bernoulli random subgraphs of the complete graph ${\cal K}_n$ having vertex sets of random sizes $X_1,\dots, X_m\in \{0,1,2,\dots\}$ and random edge densities $Q_1,\dots, Q_m\in…

A structure $\cal S$ is quasi-projective if for every structure $\cal T$, for every homomorphism $f : {\cal S} \rightarrow {\cal T}$ and every epimorphism $j: {\cal S}\rightarrow {\cal T}$ there is an endomorphism $\phi$ of $\cal S$ such…

Every set $\Lambda\subset R$ such that the sum of $\delta$-measures sitting at the points of $\Lambda$ is a Fourier quasicrystal, is the zero set of an exponential polynomial with imaginary frequencies.

A congruence on an inverse semigroup $S$ is determined uniquely by its kernel and trace. Denoting by $\rho_k$ and $\rho_t$ the least congruence on $S$ having the same kernel and the same trace as $\rho$, respectively, and denoting by…

We consider the well-studied pattern counting problem: given a permutation $\pi \in \mathbb{S}_n$ and an integer $k > 1$, count the number of order-isomorphic occurrences of every pattern $\tau \in \mathbb{S}_k$ in $\pi$. Our first result…

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

We show that a slight modification of a theorem of Ruzmaikina and Aizenman on competing particle systems on the real line leads to a characterization of Poisson-Dirichlet distributions $PD(a,0)$. Precisely, let $s$ be a proper random…