The number of dense arrangements

DOI10.1016/0097-3165(79)90026-8zbMath0434.05004OpenAlexW2042072482MaRDI QIDQ1139589

Joseph Glaz

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(79)90026-8

zbMATH Keywords

arrangementsenumeration problemcoincidence probabilities

Mathematics Subject Classification ID

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

Cites Work

• Coincidence probabilities
• Multiple coverage of the line
• A simpler expression for Kth nearest neighbor coincidence probabilities
• A generalization of the Karlin-McGregor theorem on coincidence probabilities and an application to clustering
• Probabilities for a \(k\)-th nearest neighbor problem on the line
• Probabilities for the Size of Largest Clusters and Smallest Intervals
• Probabilities for a Generalized Birthday Problem
• Note on a clustering problem
• Some Aspects of the Random Sequence
• The Generalized Birthday Problem

This page was built for publication: The number of dense arrangements