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

subsetcyclically ordered set

Mathematics Subject Classification ID

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

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

(5)

• The number of \(s\)-separated \(k\)-sets in various circles
• Selecting non-consecutive balls arranged in many lines
• On arithmetic partitions of \(\mathbb Z_n\)
• Partitions of Z_n into arithmetic progressions
• The number of subsets without a fixed circular distance

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)