On the number of combinations without a fixed distance

DOI10.1016/0097-3165(83)90019-5zbMath0522.05006OpenAlexW1982518561MaRDI QIDQ1055772

Prodinger, Helmut

Publication date: 1983

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(83)90019-5

zbMATH Keywords

difference-restrictionnumber of subsets

Mathematics Subject Classification ID

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

Related Items

The number of subsets without a fixed circular distance, Some stochastic processes in a random permutation, Subsets without \(q\)-separation and binomial products of Fibonacci numbers, A new proof of a theorem of Mansour and Sun, On Two Families of Generalizations of Pascal's Triangle, Partitions of \(\mathbb Z_n\) into arithmetic progressions, On arithmetic partitions of \(\mathbb Z_n\), On sets of integers with prescribed gaps

Cites Work

• On the number of combinations without unit separation
• Unnamed Item
• Unnamed Item