English
Related papers

Related papers: The Infinite Limit of Separable Permutations

200 papers

Let $\sigma(n)$ be the sum of the positive divisors of $n$, and let $A(t)$ be the natural density of the set of positive integers $n$ satisfying $\sigma(n)/n \ge t$. We give an improved asymptotic result for $\log A(t)$ as $t$ grows…

Number Theory · Mathematics 2010-11-19 Andreas Weingartner

The paper is primarily concerned with the asymptotic behavior as $N\to\infty$ of averages of nonconventional arrays having the form $N^{-1}\sum_{n=1}^N\prod_{j=1}^\ell T^{P_j(n,N)}f_j$ where $f_j$'s are bounded measurable functions, $T$ is…

Dynamical Systems · Mathematics 2017-11-30 Yuri Kifer

Let $S_n$ be the set of all permutations of $\{1,2,\ldots,n\}$ and let $\sigma=(\sigma_1,\sigma_2,\ldots,\sigma_n)\in S_n$. The {\it initial longest increasing sequence} (ILIS) in $\sigma$ has length $m$ if, for $1\le m\le n-1$,…

Combinatorics · Mathematics 2025-10-01 Ljuben Mutafchiev

We present new sampling methods in finite population that allow to control the joint inclusion probabilities of units and especially the spreading of sampled units in the population. They are based on the use of renewal chains and…

Methodology · Statistics 2017-04-12 Yves Tillé , Lionel Qualité , Matthieu Wilhelm

We consider random permutations on $\Sn$ with logarithmic growing cycles weights and study asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables…

Probability · Mathematics 2018-06-14 Nicolas Robles , Dirk Zeindler

Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define…

Number Theory · Mathematics 2022-01-06 Piotr Miska , János T. Tóth , Błażej Żmija

We consider correlated random variables $X_1,\dots,X_n$ taking values in $\{0,1\}$ such that, for any permutation $\pi$ of $\{1,\dots,n\}$, the random vectors $(X_1,\dots,X_n)$ and $(X_{\pi(1)},\dots,X_{\pi(n)})$ have the same distribution.…

Statistical Mechanics · Physics 2015-06-22 Max Jauregui , Constantino Tsallis

Let $S_n$ be the set of permutations on $\{1,\,\dots,\,n\}$ and $\pi\in S_n$. Let $\mathrm{d}(\pi)$ be the arithmetic average of $\{|i-\pi(i)|;\;1\le i\le n\}$. Then $\mathrm{d}(\pi)/n\in[0,\,1/2]$, the expected value of $\mathrm{d}(\pi)/n$…

Combinatorics · Mathematics 2015-09-21 Daniel Daly , Petr Vojtěchovský

Let $\Lambda$ be a uniformly discrete set and $S$ be a compact set in $R$. We prove that if there exists a bounded sequence of functions in Paley--Wiener space $PW_S$, which approximates $\delta-$functions on $\Lambda$ with $l^2-$error $d$,…

Classical Analysis and ODEs · Mathematics 2013-04-03 Alexander Olevskii , Alexander Ulanovskii

Let $G_{k,n}$ be a group of permutations of $kn$ objects which permutes things independently in disjoint blocks of size $k$ and then permutes the blocks. We investigate the probabilistic and/or enumerative aspects of random elements of…

Probability · Mathematics 2025-04-29 Persi Diaconis , Nathan Tung

Let $S_n$ denote the set of permutations of $n$ labels. We consider a class of Gibbs probability models on $S_n$ that is a subfamily of the so-called Mallows model of random permutations. The Gibbs energy is given by a class of right…

Probability · Mathematics 2024-06-28 Soumik Pal

Let G be a finite group. Let pi be a permutation from S{n}. We study the distribution of probabilities of equality a{1} a{2} ...a{n-1}a{n}=a{pi{1}}^{epsilon{1}} a{pi_{2}}^{epsilon{2}}...a{pi{n-1}}^{epsilon_{n-1}} a_{pi_{n}}^{epsilon{n}},…

Group Theory · Mathematics 2020-10-20 Robert Shwartz , Vadim E. Levit

Let $X=\{X_n: n\in\mathbb{N}\}$ be the linear process defined by $X_n=\sum^{\infty}_{j=1} a_j\varepsilon_{n-j}$, where the coefficients $a_j=j^{-\beta}\ell(j)$ are constants with $\beta>0$ and $\ell$ a slowly varying function, and the…

Probability · Mathematics 2025-03-03 Yudan Xiong , Fangjun Xu , Jinjiong Yu

We study a probability measure on integral dominant weights in the decomposition of $N$-th tensor power of spinor representation of the Lie algebra $so(2n+1)$. The probability of the dominant weight $\lambda$ is defined as the ratio of the…

Representation Theory · Mathematics 2023-02-28 Anton Nazarov , Olga Postnova

We study Haar unitary random matrices with permuted entries. For a sequence of permutations $\left(\sigma_N\right)_N$, where $\sigma_N$ acts on $N\times N$ matrices we identify conditions under which the $\ast$--distribution of permuted…

Probability · Mathematics 2021-02-23 James A. Mingo , Mihai Popa , Kamil Szpojankowski

It is shown that a set in product of $n$ metrizable spaces is the discontinuity points set of some separately continuous function if and only if this set can be represented as the union of a sequence of $F_{\sigma}$-sets which are locally…

General Topology · Mathematics 2015-12-29 V. K. Maslyuchenko , V. V. Mykhaylyuk

We obtain mproved bounds for one bit sensing. For instance, let $ K_s$ denote the set of $ s$-sparse unit vectors in the sphere $ \mathbb S ^{n}$ in dimension $ n+1$ with sparsity parameter $ 0 < s < n+1$ and assume that $ 0 < \delta < 1$.…

Classical Analysis and ODEs · Mathematics 2015-12-22 Dmitriy Bilyk , Michael T. Lacey

We are looking for integer numbers $g_{j}$ and $x_{j}$ ($j=1,...,n$) such that the sums $T_{\pi} := \sum_{j=1}^{n} g_{j} \cdot x_{\pi\left( j\right) }$ are different for all permutations $\pi\in S_{n}$ and $\max\left\{T_{\pi}:\pi\in…

General Mathematics · Mathematics 2025-12-25 István Szalkai

We establish a scaling limit result for the length $\operatorname{LIS}(\sigma_n)$ of the longest increasing subsequence of a permutation $\sigma_n$ of size $n$ sampled from the Brownian separable permuton $\boldsymbol{\mu}_p$ of parameter…

Probability · Mathematics 2025-06-25 Arka Adhikari , Jacopo Borga , Thomas Budzinski , William Da Silva , Delphin Sénizergues

Define $S_n^k(T)$ to be the set of permutations of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid all patterns in $T \subseteq S_m$. We enumerate $S_n^k(T)$, $T \subseteq S_3$, for all $|T| \geq 2$ and $0 \leq k \leq n$.

Combinatorics · Mathematics 2007-05-23 Toufik Mansour , Aaron Robertson