pith. sign in

arxiv: 1907.00632 · v1 · pith:6AFPYUAFnew · submitted 2019-07-01 · 🧮 math.PR · math.CO

Limit theorems for statistics of non-crossing partitions

Vladislav Kargin This is my paper

Pith reviewed 2026-05-25 12:05 UTC · model grok-4.3

classification 🧮 math.PR math.CO
keywords non-crossing partitionslimit theoremsGaussian limitsgeometric distributionlargest blockwidththeta distribution
0
0 comments X

The pith

Non-crossing partitions exhibit Gaussian limits for fixed-size block counts, negative correlations between sizes, geometric block sizes, log2 n largest block, and theta-distributed width.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves limit theorems for several statistics of large non-crossing partitions chosen uniformly at random. The number of blocks of a fixed size is Gaussian, and counts for different sizes are negatively correlated. Block sizes follow a geometric distribution rather than Poisson. The largest block concentrates at log base 2 of n with double exponential fluctuations after scaling. The width converges to the theta distribution. These findings describe the typical features of such partitions in the large limit.

Core claim

We prove the Gaussian limit theorem for the number of blocks of a given fixed size. In contrast to usual set partitions, the number of blocks of different sizes are negatively correlated. The sizes of blocks follow a geometric distribution. The size of the largest block concentrates at log2 n with double exponential distribution after rescaling. The width converges to the Theta-distribution.

What carries the argument

Uniform random non-crossing partition of the set [n] and its block-related statistics under the uniform measure.

If this is right

  • The counts of blocks of different fixed sizes are jointly Gaussian with negative covariances.
  • The empirical distribution of block sizes in a random non-crossing partition is geometric.
  • The maximum block size rescaled around log2 n converges to a double exponential distribution.
  • The width of the partition converges in law to the theta distribution from Brownian excursion theory.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The non-crossing condition leads to negative correlations and geometric rather than Poisson block sizes, distinguishing these partitions from unrestricted ones.
  • The convergence of the width to the theta distribution links non-crossing partitions to the theory of Brownian excursions.

Load-bearing premise

Non-crossing partitions of [n] are selected according to the uniform probability measure.

What would settle it

Monte Carlo sampling of many non-crossing partitions for large n to verify if the sample variance of the number of size-1 blocks matches the asymptotic formula and if the sample covariance with the number of size-2 blocks is negative.

read the original abstract

We study the distribution of several statistics of large non-crossing partitions. First, we prove the Gaussian limit theorem for the number of blocks of a given fixed size. In contrast to the properties of usual set partitions, we show that the number of blocks of different sizes are negatively correlated, even for large partitions. In addition, we show that the sizes of blocks in a given large non-crossing partition are distributed according to a geometric distribution and not Poisson, as in the case of usual set partitions. Next, we show that the size of the largest block concentrates at $\log_2 n$, and that after an appropriate rescaling, it can be described by the double exponential distribution. Finally, we show that the width of a large non-crossing partition converges to the Theta-distribution which arises in the theory of Brownian excursions.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper studies the asymptotic distribution of several statistics on uniformly random non-crossing partitions of [n] as n tends to infinity. It establishes a Gaussian limit theorem for the number of blocks of any fixed size, proves that these counts for different sizes are negatively correlated, shows that block sizes follow a geometric distribution, proves that the largest block size concentrates at log_2 n with double-exponential fluctuations after rescaling, and shows that the width converges in distribution to the Theta law arising from Brownian excursions.

Significance. If the derivations hold, the results give a detailed and coherent probabilistic description of non-crossing partitions that contrasts usefully with the classical set-partition case. The geometric block-size law, negative correlations, and extreme-value behavior for the largest block are natural consequences of the Catalan recursive structure and its bijections to Dyck paths; the width limit recovers the known Brownian-excursion law. The manuscript therefore supplies explicit, falsifiable limit statements that can be checked against the generating-function factorization and the linear dependence induced by the fixed total size n.

minor comments (2)
  1. The abstract and introduction should include a brief sentence recalling the definition of the uniform measure on non-crossing partitions (or cite the standard reference) to make the probability space explicit for readers outside combinatorics.
  2. The Theta-distribution is mentioned without a reference or short definition; adding a pointer to the Brownian-excursion literature (e.g., the standard normalization) would improve accessibility.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary, significance assessment, and recommendation to accept the manuscript. There are no major comments requiring a point-by-point response.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The derivation relies on the standard recursive decomposition of non-crossing partitions (via Catalan generating functions and bijections to Dyck paths), which independently yields the geometric block-size law, the log2 n extreme-value location for the largest block, negative correlations from the fixed-n constraint, Gaussian limits via moment methods or generating-function asymptotics, and width convergence to the Theta law as the Brownian-excursion limit. None of these steps reduce by construction to fitted parameters, self-definitions, or load-bearing self-citations; the results follow directly from the combinatorial enumeration and probabilistic analysis without circular equivalence to the inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Insufficient information in the provided abstract to identify specific free parameters, axioms, or invented entities; the work relies on standard combinatorial enumeration of non-crossing partitions.

pith-pipeline@v0.9.0 · 5657 in / 1091 out tokens · 38204 ms · 2026-05-25T12:05:56.434298+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

24 extracted references · 24 canonical work pages

  1. [1]

    Edward A. Bender. Asymptotic methods in enumeration. SIAM Review, 16(4):485 – 515, Oc- tober 1974. 19

    work page 1974

  2. [2]

    Representations of symmetric groups and free probability

    Philippe Biane. Representations of symmetric groups and free probability. Advances in Mathe- matics, 138:126–181, 1998

    work page 1998

  3. [3]

    Probability laws related to the Jacobi theta and Riemann zeta functions, and Brownian excursions.Bulletin of American Mathematical Society, 38:435–465, 2001

    Philippe Biane, Jim Pitman, and Marc Yor. Probability laws related to the Jacobi theta and Riemann zeta functions, and Brownian excursions.Bulletin of American Mathematical Society, 38:435–465, 2001

    work page 2001

  4. [4]

    Blanco and T

    Saul A. Blanco and T. Kyle Petersen. Counting Dyck paths by area and rank. Annals of Combi- natorics, 18(2):171–197, 2014

    work page 2014

  5. [5]

    Rodney Canfield

    E. Rodney Canfield. Remarks on an asymptotic method in combinatorics.Journal of Combina- torial Theory, Series A, 37:348–352, 1984

    work page 1984

  6. [6]

    N. G. de Bruijn, D. E. Knuth, and S. O. Rice. The average height of planted plane trees. In Graph theory and computing. Academic Press, New York and London, 1972

    work page 1972

  7. [7]

    Two combinatorial statistics on Dyck paths

    Alain Denise and Rodica Simion. Two combinatorial statistics on Dyck paths. Discrete Mathe- matics, 137:155 – 176, 1995

    work page 1995

  8. [8]

    Dyck path enumeration

    Emeric Deutsch. Dyck path enumeration. Discrete Mathematics, 204:167 – 202, 1999

    work page 1999

  9. [9]

    The distribution of heights of binary trees and other simple trees

    Philippe Flajolet, Zhicheng Gao, Andrew Odlyzko, and Bruce Richmond. The distribution of heights of binary trees and other simple trees. Combinatorics, Probability and Computing , 2:145 – 156, 1993

    work page 1993

  10. [10]

    The average height of binary trees and other simple trees

    Philippe Flajolet and Andrew Odlyzko. The average height of binary trees and other simple trees. Journal of Computer and System Sciences, 25:171 – 213, 1982

    work page 1982

  11. [11]

    Analytic Combinatorics

    Philippe Flajolet and Robert Sedgewick. Analytic Combinatorics. Cambridge University Press, 2009

    work page 2009

  12. [12]

    Analytic Function Theory, volume 1

    Einar Hille. Analytic Function Theory, volume 1. Ginn and Company, 1962

    work page 1962

  13. [13]

    Sur les partitions non croisées d’un cycle

    Germain Kreweras. Sur les partitions non croisées d’un cycle. Discrete Mathematics, 1(4):333– 350, 1972

    work page 1972

  14. [14]

    J. C. Lagarias, A. M. Odlyzko, and D. B. Zagier. On the capacity of disjointly shared networks. Computer networks and ISDN Systems, 10(5):275 – 285, 1985

    work page 1985

  15. [15]

    Constructing a sequence of random walks strongly converging to Brownian motion

    Philippe Marchal. Constructing a sequence of random walks strongly converging to Brownian motion. In Discrete random walks, pages 181–190, 2003

    work page 2003

  16. [16]

    Meir and J

    A. Meir and J. W. Moon. On an asymptotic method in enumeration. Journal of Combinatorial Theory, Series A, 51:77– 89, 1989

    work page 1989

  17. [17]

    Free probability aspect of irreducible meandric systems, and some related observations about meanders

    Alexandru Nica. Free probability aspect of irreducible meandric systems, and some related observations about meanders. Infinite Dimensional Analysis, Quantum Probability and Related Topics, 19(2), 2016

    work page 2016

  18. [18]

    Lectures on the Combinatorics of Free Probability, vol- ume 335 of London Mathematical Society Lecture Note Series

    Alexandru Nica and Roland Speicher. Lectures on the Combinatorics of Free Probability, vol- ume 335 of London Mathematical Society Lecture Note Series . Cambridge University Press, 2006

    work page 2006

  19. [19]

    On the distribution of ranked heights of excursions of a Brownian bridge

    Jim Pitman and Marc Yor. On the distribution of ranked heights of excursions of a Brownian bridge. Annals of Probability, 29(1):361 – 384, 2001

    work page 2001

  20. [20]

    Vladimir N. Sachkov. Probabilistic methods in combinatorial analysis, volume 56 of Encyclo- pedia of Mathematics and Its Applications. Cambridge University Press, 1997

    work page 1997

  21. [21]

    Combinatorial statistics on non-crossing partitions

    Rodica Simion. Combinatorial statistics on non-crossing partitions. Journal of Combinatorial Theory, Series A, 66:270–301, 1994

    work page 1994

  22. [22]

    Noncrossing partitions

    Rodica Simion. Noncrossing partitions. Discrete Mathematics, 217:367 – 409, 2000

    work page 2000

  23. [23]

    Richard P. Stanley. Catalan numbers. Cambridge University Press, 2015

    work page 2015

  24. [24]

    More bijective Catalan combinatorics on permutations and on signed permu- tations

    Christian Stump. More bijective Catalan combinatorics on permutations and on signed permu- tations. Journal of Combinatorics, 4(4):419 – 447, 2013

    work page 2013