English
Related papers

Related papers: Universality of random permutations

200 papers

A \emph{linear extension} of a partial order \(\preceq\) over items \(A = \{ 1, 2, \ldots, n \}\) is a permutation \(\sigma\) such that for all \(i < j\) in \(A\), it holds that \(\neg(\sigma(j) \preceq \sigma(i))\). Consider the problem of…

Computational Complexity · Computer Science 2025-06-18 Mark Huber

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

Probability · Mathematics 2007-05-23 Chris A. J. Klaassen , J. Theo Runnenburg

We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…

General Mathematics · Mathematics 2026-01-23 Edwige Tolla

A classical result of Erd\H{o}s, Lov\'asz and Spencer from the late 1970s asserts that the dimension of the feasible region of densities of graphs with at most k vertices in large graphs is equal to the number of non-trivial connected…

Combinatorics · Mathematics 2025-03-19 Frederik Garbe , Daniel Kral , Alexandru Malekshahian , Raul Penaguiao

A result of Rosenthal says that for every $q>1$ and $n \in \mathbb{N}$ there is $N \in \mathbb{N}$ such that every sequence of $N$ distinct positive numbers contains, after a suitable translation and possible multiplication by $-1$, a…

Combinatorics · Mathematics 2018-05-21 Attila Por

Permutons, which are probability measures on the unit square $[0, 1]^2$ with uniform marginals, are the natural scaling limits for sequences of (random) permutations. We introduce a $d$-dimensional generalization of these measures for all…

Probability · Mathematics 2025-02-03 Jacopo Borga , Andrew Lin

We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in…

Probability · Mathematics 2009-01-16 Florent Benaych-Georges

Let $A(\ell,n,k)$ denote the number of $\ell$-tuples of commuting permutations of $n$ elements whose permutation action results in exactly $k$ orbits or connected components. We provide a new proof of an explicit formula for $A(\ell,n,k)$…

Combinatorics · Mathematics 2024-04-17 Abdelmalek Abdesselam , Pedro Brunialti , Tristan Doan , Philip Velie

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$. For $A(n)=A\cap [n]$, the limit $\rho=\lim_{n\to\infty}\mid A(n)\mid/n$ (if it esists) is…

Combinatorics · Mathematics 2021-10-05 Ljuben Mutafchiev

Assuming a $q$-variant of the prime $k$-tuple conjecture uniformly, we compute mixed moments of the number of primes in disjoint short intervals and progressions, respectively. This involves estimating the mean of singular series along…

Number Theory · Mathematics 2024-11-26 Sun-Kai Leung

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…

Combinatorics · Mathematics 2014-07-02 Filippo Disanto , Thomas Wiehe

Let $\alpha(n)$ denote the number of perfect square permutations in the symmetric group $S_n$. The conjecture $\alpha(2n+1) = (2n+1) \alpha(2n)$, provided by Stanley[4], was proved by Blum[1] using a generating function. This paper presents…

Combinatorics · Mathematics 2024-07-11 Yuewen Luo

Denote by r(n) the length of a shortest integer sequence on a circle containing all permutations of the set {1,2,...,n} as subsequences. Hansraj Gupta conjectured in 1981 that r(n) <= n^2/2. In this paper we confirm the conjecture for the…

Combinatorics · Mathematics 2010-09-28 Emmanuel Lecouturier , David Zmiaikou

Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i…

Combinatorics · Mathematics 2015-08-18 Sergey Bereg , Alexander E. Holroyd , Lev Nachmanson , Sergey Pupyrev

We show that integral representation of universal volume function of compact simple Lie groups gives rise to six analytic functions on $CP^2$, which transform as two triplets under group of permutations of Vogel's projective parameters.…

High Energy Physics - Theory · Physics 2017-04-05 H. M. Khudaverdian , R. L. Mkrtchyan

A word $u$ is a subsequence of another word $w$ if $u$ can be obtained from $w$ by deleting some of its letters. The word $w$ with alph$(w)=\Sigma$ is called $k$-subsequence universal if the set of subsequences of length $k$ of $w$ contains…

Data Structures and Algorithms · Computer Science 2020-07-21 Pamela Fleischmann , Maria Kosche , Tore Koß , Florin Manea , Stefan Siemer

We prove that the uniform probability measure $\mu$ on every $(n-k)$-dimensional projection of the $n$-dimensional unit cube verifies the variance conjecture with an absolute constant $C$ $$\textrm{Var}_\mu|x|^2\leq C \sup_{\theta\in…

Functional Analysis · Mathematics 2017-03-30 David Alonso-Gutiérrez , Julio Bernués

A universally L^1 good sequence n_k is constructed with n_{k+1}-n_k tending to infinity. For ergodic transformations non-conventional ergodic averages of L^1 functions computed by using this sequence converge to the integral of the…

Dynamical Systems · Mathematics 2007-05-23 Zoltan Buczolich

This is the fourth in a series of articles devoted to showing that a typical covering map of large degree to a fixed, regular graph has its new adjacency eigenvalues within the bound conjectured by Alon for random regular graphs. In this…

Probability · Mathematics 2019-11-14 Joel Friedman , David Kohler

A locally uniform random permutation is generated by sampling $n$ points independently from some absolutely continuous distribution $\rho$ on the plane and interpreting them as a permutation by the rule that $i$ maps to $j$ if the $i$th…

Probability · Mathematics 2023-03-07 Jonas Sjöstrand