Counting the decimation classes of binary vectors with relatively prime length and density

DOI10.1007/s10801-020-00990-zzbMath1486.90127OpenAlexW3109200346MaRDI QIDQ2114775

Jonathan S. Turner, Dursun A. Bulutoglu, Andrew J. Geyer, Daniel Baczkowski

Publication date: 15 March 2022

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-020-00990-z

zbMATH Keywords

recursionlattice of subgroupsnecklacemultiplier groupbraceletLegendre pair

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) General theory for finite permutation groups (20B05)

Related Items (1)

Legendre pairs of lengths \(\ell \equiv 0 \pmod 5\)

Cites Work

• Unnamed Item
• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
• On variations of the subset sum problem
• Charm bracelets and their application to the construction of periodic Golay pairs
• Hadamard ideals and Hadamard matrices with two circulant cores
• Equivalence classes of periodic sequences
• The Rank of Circulant Matrices
• On Collineations of Symmetric Designs
• Translates and Multipliers of Abelian Difference Sets
• Elementary Divisor Rings and Finitely Presented Modules
• An Efficient Algorithm for Generating Necklaces with Fixed Density
• On Multipliers of Difference Sets

This page was built for publication: Counting the decimation classes of binary vectors with relatively prime length and density