Selecting non-consecutive balls arranged in many lines

DOI10.1016/0097-3165(84)90053-0zbMATH Open0559.05003OpenAlexW2024847992MaRDI QIDQ802558FDOQ802558

Authors: Victor K. Wei, Frank K. Hwang, János Körner 

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)90053-0

Recommendations

• On selecting \(k\) balls from an \(n\)-line without unit separation
• A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization
• scientific article; zbMATH DE number 980251
• scientific article; zbMATH DE number 733917
• A counting method for non-neighboring rearrangement

zbMATH Keywords

ball selectionchoice problem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Cites Work

• Title not available (Why is that?)
• Solution of the “Problème des ménages”
• On the number of combinations without unit separation
• Cycle Polynomials
• Selecting k objects from a cycle with p pairs of separation s

Cited In (8)

• Two selection problems revisited
• A counting method for non-neighboring rearrangement
• Balls into bins with related random choices
• On sets of integers with prescribed gaps
• On arithmetic partitions of \(\mathbb Z_n\)
• Partitions of \(\mathbb Z_n\) into arithmetic progressions
• Subsets without \(q\)-separation and binomial products of Fibonacci numbers
• On selecting \(k\) balls from an \(n\)-line without unit separation

This page was built for publication: Selecting non-consecutive balls arranged in many lines

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