Degrees in random uniform minimal factorizations
DOI10.1016/J.DISC.2021.112715zbMATH Open1480.05104arXiv2012.06358OpenAlexW3216108201WikidataQ114190573 ScholiaQ114190573MaRDI QIDQ2065894FDOQ2065894
Authors: Etienne Bellin
Publication date: 13 January 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.06358
Recommendations
- Trajectories in random minimal transposition factorizations
- The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
- Random stable-type minimal factorizations of the \(n\)-cycle
- Inequivalent transitive factorizations into transpositions
- Minimal factorizations of a cycle: a multivariate generating function
Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Nombre de factorisations d'un grand cycle (Number of factorizations of a large cycle)
- Parking functions of types A and B
- A solution to a problem of Dénes: A bijection between trees and factorizations of cyclic permutations
- Some properties of crossings and partitions
- Tree-like properties of cycle factorizations
- Labelled trees and factorizations of a cycle into transpositions
- Title not available (Why is that?)
- Title not available (Why is that?)
- The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
- Weighted Hurwitz numbers and topological recursion: an overview
- Trajectories in random minimal transposition factorizations
Cited In (5)
- Random generation and scaling limits of fixed genus factorizations into transpositions
- Random stable-type minimal factorizations of the \(n\)-cycle
- Trajectories in random minimal transposition factorizations
- The geometry of random minimal factorizations of a long cycle via biconditioned bitype random trees
- The number of prefixes of minimal factorisations of a cycle
This page was built for publication: Degrees in random uniform minimal factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065894)