On the number of combinations without unit separation

DOI10.1016/0097-3165(81)90006-6MaRDI QIDQ1156797zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 3308309 (Why is no real title available?)
• Solution of the “Problème des ménages”

Cited in

(13)

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

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

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