MacMahon partition analysis: a discrete approach to broken stick problems
From MaRDI portal
Publication:2068609
DOI10.1016/j.jcta.2021.105571zbMath1480.05009arXiv2107.10318OpenAlexW3215731023MaRDI QIDQ2068609
Publication date: 20 January 2022
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.10318
Geometric probability and stochastic geometry (60D05) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lecture hall partitions
- The On-Line Encyclopedia of Integer Sequences
- On the probability of forming polygons from a broken stick
- Linear homogeneous Diophantine equations and magic labelings of graphs
- Macmahon's partition analysis IX:K-gon partitions
- The Broken Spaghetti Noodle
- Broken Bricks and the Pick-up Sticks Problem
- MacMahon's partition analysis: The Omega package
This page was built for publication: MacMahon partition analysis: a discrete approach to broken stick problems