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

DOI10.1016/0097-3165(84)90071-2MaRDI QIDQ797581zbMATH OpenOpenAlexFDO

Authors 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

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

Review text

Generalizing a result of \textit{J. Konvalina} [ibid. 31, 101-107 (1981; Zbl 0469.05003)], the author determines the number of ways a k-element subset can be chosen from a cyclically ordered n-set without two points of distance \(s\geq 1\). For \(n\geq 1+km\) where \(m=(s,n)\), the formula reduces to \((n/k)\binom{n-k-1}{k-1}.\)

Recommendations

• scientific article; zbMATH DE number 1256675
• scientific article; zbMATH DE number 733917
• scientific article; zbMATH DE number 1222152
• On the number of permutations on n objects with greatest cycle length k
• scientific article; zbMATH DE number 949691
• On selecting \(k\) balls from an \(n\)-line without unit separation
• Selecting the k largest elements with parity tests
• scientific article; zbMATH DE number 1303027

Cites work

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

Cited in

(6)

• Partitions of Z_n into arithmetic progressions
• On arithmetic partitions of \(\mathbb Z_n\)
• The number of subsets without a fixed circular distance
• A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization
• The number of s-separated k-sets in various circles
• Selecting non-consecutive balls arranged in many lines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797581)