English

Degrees in random uniform minimal factorizations

Combinatorics 2020-12-14 v1 Probability

Abstract

We are interested in random uniform minimal factorizations of the nn-cycle which are factorizations of (1 2n)(1~2\dots n) into a product of n1n-1 transpositions. Our main result is an explicit formula for the joint probability that 1 and 2 appear a given number of times in a uniform minimal factorization. For this purpose, we combine bijections with Cayley trees together with explicit computations of multivariate generating functions.

Keywords

Cite

@article{arxiv.2012.06358,
  title  = {Degrees in random uniform minimal factorizations},
  author = {Etienne Bellin},
  journal= {arXiv preprint arXiv:2012.06358},
  year   = {2020}
}

Comments

10 pages, 3 figures

R2 v1 2026-06-23T20:54:09.051Z