The number of subsets without a fixed circular distance

DOI10.1016/0097-3165(86)90030-0zbMath0595.05004OpenAlexW2026780448MaRDI QIDQ1077416

W. O. J. Moser

Publication date: 1986

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(86)90030-0

zbMATH Keywords

enumerationnumber of k-element subsets

Mathematics Subject Classification ID

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

Related Items (2)

Partitions of \(\mathbb Z_n\) into arithmetic progressions ⋮ On arithmetic partitions of \(\mathbb Z_n\)

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of combinations without a fixed distance
• On the number of combinations without unit separation
• A New Identity and Some Applications
• Enumeration of combinations with restricted differences and cospan

This page was built for publication: The number of subsets without a fixed circular distance