Selecting k objects from a cycle with p pairs of separation s

DOI10.1016/0097-3165(84)90071-2zbMath0545.05007OpenAlexW2087625549MaRDI QIDQ797581

Frank K. Hwang

Publication date: 1984

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(84)90071-2

zbMATH Keywords

cyclically ordered setsubset

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Permutations, words, matrices (05A05)

Related Items (3)

Partitions of \(\mathbb Z_n\) into arithmetic progressions ⋮ On arithmetic partitions of \(\mathbb Z_n\) ⋮ Selecting non-consecutive balls arranged in many lines

Cites Work

• On the number of combinations without unit separation
• Cycle Polynomials

This page was built for publication: Selecting k objects from a cycle with p pairs of separation s