English
Related papers

Related papers: Asymptotic behavior of permutation records

200 papers

We study the asymptotic behavior of the rank statistic for unimodal sequences. We use analytic techniques involving asymptotic expansions in order to prove asymptotic formulas for the moments of the rank. Furthermore, when appropriately…

Number Theory · Mathematics 2019-10-25 Kathrin Bringmann , Chris Jennings-Shaffer , Karl Mahlburg

We study asymptotics of representations of the unitary groups U(n) in the limit as n tends to infinity and we show that in many aspects they behave like large random matrices. In particular, we prove that the highest weight of a random…

Representation Theory · Mathematics 2013-07-16 Benoit Collîns , Piotr Śniady

A random spherical polytope $P_n$ in a spherically convex set $K \subset S^d$ as considered here is the spherical convex hull of $n$ independent, uniformly distributed random points in $K$. The behaviour of $P_n$ for a spherically convex…

Probability · Mathematics 2015-05-19 Imre Bárány , Daniel Hug , Matthias Reitzner , Rolf Schneider

We study statistical properties of the random variables $X_{\sigma}(\pi)$, the number of occurrences of the pattern $\sigma$ in the permutation $\pi$. We present two contrasting approaches to this problem: traditional probability theory and…

Combinatorics · Mathematics 2013-12-17 Svante Janson , Brian Nakamura , Doron Zeilberger

In this paper we study asymptotic behavior of regular subsets in a free group F of finite rank, compare their sizes at infinity, and develop techniques to compute the probabilities of sets relative to distributions on F that come naturally…

Group Theory · Mathematics 2009-06-17 Elizaveta Frenkel , Alexei G. Myasnikov , Vladimir N. Remeslennikov

Let $S(d,N)$ denote the number of permutations in the symmetric group on $[N]$ which have no decreasing subsequence of length $d+1.$ We prove that $S(d,dn)$ is asymptotically equal to the number of standard Young tableaux of rectangular…

Combinatorics · Mathematics 2010-02-12 Jonathan Novak

We study (asymmetric) $U$-statistics based on a stationary sequence of $m$-dependent variables; moreover, we consider constrained $U$-statistics, where the defining multiple sum only includes terms satisfying some restrictions on the gaps…

Probability · Mathematics 2022-03-10 Svante Janson

We will study the asymptotic behavior of summation functions of a natural argument, including the asymptotic behavior of summation functions of a prime argument in the paper. A general formula is obtained for determining the asymptotic…

General Mathematics · Mathematics 2020-07-01 Victor Volfson

We obtain an explicit formula for the variance of the number of $k$-peaks in a uniformly random permutation. This is then used to obtain an asymptotic formula for the variance of the length of longest $k$-alternating subsequence in random…

Probability · Mathematics 2026-04-15 Recep Altar Çiçeksiz , Yunus Emre Demirci , Ümit Işlak

The number of fixed points of a random permutation of 1,2,...,n has a limiting Poisson distribution. We seek a generalization, looking at other actions of the symmetric group. Restricting attention to primitive actions, a complete…

Combinatorics · Mathematics 2007-08-21 Persi Diaconis , Jason Fulman , Robert Guralnick

We consider two multiplicative statistics on the set of integer partitions: the norm of a partition, which is the product of its parts, and the supernorm of a partition, which is the product of the prime numbers $p_i$ indexed by its parts…

Combinatorics · Mathematics 2023-08-30 Jeffrey C. Lagarias , Chenyang Sun

We study the asymptotic behaviour of the trace (the sum of the diagonal parts) of a plane partition of the positive integer n, assuming that this parfition is chosen uniformly at random from the set of all such partitions.

Combinatorics · Mathematics 2011-11-10 Ljuben Mutafchiev , Emil Kamenov

We consider a generalization of the Ewens measure for the symmetric group, calculating moments of the characteristic polynomial and similar multiplicative statistics. In addition, we study the asymptotic behavior of linear statistics (such…

Probability · Mathematics 2013-03-14 Christopher Hughes , Joseph Najnudel , Ashkan Nikeghbali , Dirk Zeindler

This work gives a general approach to the determination of the asymptotic behavior of the sums of functions of primes based on the distribution of primes. It refines the estimate of the remainder term of the asymptotic expansion of the sums…

Number Theory · Mathematics 2020-08-27 Victor Volfson

Given a countably infinite group $G$ acting on some space $X$, an increasing family of finite subsets $G_n$ and $x\in X$, a natural question to ask is what asymptotical distribution the sets $G_nx$ form. More formally, we define for a…

Dynamical Systems · Mathematics 2020-09-23 Uriya Pumerantz

We consider asymptotic behavior of the correlation functions of the characteristic polynomials of the hermitian sample covariance matrices $H_n=n^{-1}A_{m,n}^*A_{m,n}$, where $A_{m,n}$ is a $m\times n$ complex matrix with independent and…

Mathematical Physics · Physics 2011-05-19 T. Shcherbina

In this paper, we discuss asymptotic behavior of the capacity of the range of symmetric simple random walks on finitely generated groups. We show the corresponding strong law of large numbers and central limit theorem.

Probability · Mathematics 2021-11-19 Rudi Mrazović , Nikola Sandrić , Stjepan Šebek

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…

Number Theory · Mathematics 2023-05-04 Dor Elboim , Ofir Gorodetsky

In this paper, we prove that the symmetric group $\mathrm{S}_n$ has $2^{n^2/16+o(n^2)}$ subgroups, settling a conjecture of Pyber from 1993. We also derive asymptotically sharp upper and lower bounds on the number of subgroups of…

Group Theory · Mathematics 2025-03-10 Colva M. Roney-Dougal , Gareth Tracey

In this paper, we study the asymptotic behavior of the number of rarely visited edges (i.e., edges that visited only once) of a simple symmetric random walk on $\mathbb{Z}$. Let $\alpha(n)$ be the number of rarely visited edges up to time…

Probability · Mathematics 2026-01-21 Ze-Chun Hu , Xue Peng , Renming Song , Yuan Tan