English
Related papers

Related papers: Large-scale Rook Placements

200 papers

We initiate the study of limit shapes for random permutations avoiding a given pattern. Specifically, for patterns of length 3, we obtain delicate results on the asymptotics of distributions of positions of numbers in the permutations. We…

Combinatorics · Mathematics 2013-12-02 Sam Miner , Igor Pak

We obtain scaling and local limit results for large random Young tableaux of fixed shape $\lambda^0$ via the asymptotic analysis of a determinantal point process due to Gorin and Rahman (2019). More precisely, we prove: (1) an explicit…

Probability · Mathematics 2024-04-23 Jacopo Borga , Cédric Boutillier , Valentin Féray , Pierre-Loïc Méliot

Two boards are rook equivalent if they have the same number of non-attacking rook placements for any number of rooks. Define a rook equivalence graph of an equivalence set of Ferrers boards by specifying that two boards are connected by an…

Combinatorics · Mathematics 2019-01-08 Kenneth Barrese

We prove a $q$-analog of the following result due to McKay, Morse and Wilf: the probability that a random standard Young tableau of size $n$ contains a fixed standard Young tableau of shape $\lambda\vdash k$ tends to $f^{\lambda}/k!$ in the…

Combinatorics · Mathematics 2011-08-30 Jang Soo Kim

Let $w:[0,1]^2\rightarrow [0,1]$ be a symmetric function, and consider the random process $G(n,w)$, where vertices are chosen from $[0,1]$ uniformly at random, and $w$ governs the edge formation probability. Such a random graph is said to…

Combinatorics · Mathematics 2016-09-15 Huda Chuangpishit , Mahya Ghandehari , Jeannette Janssen

We study a family of polynomials associated with ascent-descent statistics on labeled rooted plane k-ary trees introduced by Gessel, from a rook-theoretic perspective. We generalize the excedance statistic on permutations to maximal…

Combinatorics · Mathematics 2016-04-26 Vasu Tewari

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-12-08 Jonas Sjöstrand

The work of Vershik and Kerov [1977], Logan and Shepp [1977] established that the shape of the scaled random young diagram in Russian notation, as determined by the Plancherel measure, converges to a deterministic shape. In this article, we…

Probability · Mathematics 2023-05-09 Mohamed Slim Kammoun

We consider long-range percolation on $\mathbb{Z}^d$, where the probability that two vertices at distance $r$ are connected by an edge is given by $p(r)=1-\exp[-\lambda(r)]\in(0,1)$ and the presence or absence of different edges are…

Probability · Mathematics 2011-01-10 Pieter Trapman

We consider maximum rooted tree extension counts in random graphs, i.e., we consider M_n = \max_v X_v where X_v counts the number of copies of a given tree in G_{n,p} rooted at vertex v. We determine the asymptotics of M_n when the random…

Probability · Mathematics 2026-01-29 Pedro Araújo , Simon Griffiths , Matas Šileikis , Lutz Warnke

We introduce a large class of random Young diagrams which can be regarded as a natural one-parameter deformation of some classical Young diagram ensembles; a deformation which is related to Jack polynomials and Jack characters. We show that…

Probability · Mathematics 2022-12-12 Maciej Dołęga , Piotr Śniady

We prove a limit shape theorem describing the asymptotic shape of bumping routes when the Robinson-Schensted algorithm is applied to a finite sequence of independent, identically distributed random variables with the uniform distribution…

Combinatorics · Mathematics 2015-11-25 Dan Romik , Piotr Śniady

A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…

Combinatorics · Mathematics 2010-03-30 Aaron Abrams , Eric Babson , Henry Landau , Zeph Landau , James Pommersheim

Let $p(n)$ be the number of all integer partitions of the positive integer $n$ and let $\lambda$ be a partition, selected uniformly at random from among all such $p(n)$ partitions. It is known that each partition $\lambda$ has a unique…

Combinatorics · Mathematics 2019-12-06 Ljuben Mutafchiev

We prove and generalize a conjecture in arXiv:1610.0474(4) about the asymptotics of $\frac{1}{\sqrt{n!}} f^{\lambda/\mu}$, where $f^{\lambda/\mu}$ is the number of standard Young tableaux of skew shape $\lambda/\mu$ which have stable limit…

Combinatorics · Mathematics 2021-01-29 Alejandro Morales , Igor Pak , Martin Tassy

Let $k \ge 3$ be a fixed integer. We exactly determine the asymptotic distribution of $\ln Z_k(G(n,m))$, where $Z_k(G(n,m))$ is the number of $k$-colourings of the random graph $G(n,m)$. A crucial observation to this aim is that the…

Combinatorics · Mathematics 2016-09-15 Felicia Rassmann

It has long been known that random regular graphs are with high probability good expanders. This was first established in the 1980s by Bollob\'as by directly calculating the probability that a set of vertices has small expansion and then…

Discrete Mathematics · Computer Science 2012-11-05 Michael Lampis

Let $G$ be a complex reductive group, $B$ be a Borel subgroup of G, $\nt$ be the Lie algebra of the unipotent radical of $B$, and $\nt^*$ be its dual space. Let $\Phi$ be the root system of $G$, and $\Phi^+$ be the set of positive roots…

Representation Theory · Mathematics 2014-10-16 Mikhail V. Ignatyev , Anton S. Vasyukhin

We consider the growth of heights of the points of the orbits of (piecewise) affine maps of the plane, with rational parameters. We analyse the asymptotic growth rate of both global and local ($p$-adic) heights, for the primes $p$ that…

Dynamical Systems · Mathematics 2015-06-22 John A. G. Roberts , Franco Vivaldi

In the on-line nearest-neighbour graph (ONG), each point after the first in a sequence of points in R^d is joined by an edge to its nearest-neighbour amongst those points that precede it in the sequence. We study the large-sample asymptotic…

Probability · Mathematics 2008-05-13 Mathew D. Penrose , Andrew R. Wade