The necklace process: a generating function approach

DOI10.1016/j.spl.2018.06.010zbMath1407.60016arXiv1801.09934OpenAlexW2787768592MaRDI QIDQ1726705

Benjamin Hackl, Prodinger, Helmut

Publication date: 20 February 2019

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.09934

zbMATH Keywords

bivariate generating functionquasi-power theoremnecklace process

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Related Items (2)

Interview with Helmut Prodinger ⋮ An asymptotic distribution theory for Eulerian recurrences with applications

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• On convergence rates in the central limit theorems for combinatorial structures
• Fully Analyzing an Algebraic Pólya Urn Model
• Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology
• Singularity Analysis of Generating Functions
• Necklace Processes Via Pólya Urns
• The Necklace Process

This page was built for publication: The necklace process: a generating function approach