On the number of combinations without unit separation

DOI10.1016/0097-3165(81)90006-6zbMath0469.05003OpenAlexW2033945523MaRDI QIDQ1156797

John Konvalina

Publication date: 1981

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(81)90006-6

zbMATH Keywords

subsets of integers

Mathematics Subject Classification ID

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

Related Items (13)

The number of subsets without a fixed circular distance ⋮ Some stochastic processes in a random permutation ⋮ The number of s-separated k-sets in various circles ⋮ On the number of combinations without certain separations ⋮ Subsets without \(q\)-separation and binomial products of Fibonacci numbers ⋮ A new proof of a theorem of Mansour and Sun ⋮ Partitions of \(\mathbb Z_n\) into arithmetic progressions ⋮ On arithmetic partitions of \(\mathbb Z_n\) ⋮ A partition identity ⋮ On the number of combinations without a fixed distance ⋮ Selecting k objects from a cycle with p pairs of separation s ⋮ Selecting non-consecutive balls arranged in many lines ⋮ On sets of integers with prescribed gaps

Cites Work

• Solution of the “Problème des ménages”
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of combinations without unit separation