An algorithm for enumerating difference sets

DOI10.2140/jsag.2019.9.35zbMath1420.05025arXiv1807.02194OpenAlexW2950610823WikidataQ127537800 ScholiaQ127537800MaRDI QIDQ2325366

Dylan Peifer

Publication date: 25 September 2019

Published in: The Journal of Software for Algebra and Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.02194

zbMATH Keywords

gapdifference setsexhaustive search

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Related Items

Constructions of difference sets in nonabelian 2-groups

Cites Work

• Unnamed Item
• On the existence of difference sets in groups of order 96
• Variations on a scheme of McFarland for noncyclic difference sets
• A summary of noncylic difference sets, \(k<20\)
• Non-abelian Hadamard difference sets
• A unifying construction for difference sets
• Construction of strongly regular graphs using affine designs
• Finding the smallest image of a set
• A Theorem in Finite Projective Geometry and Some Applications to Number Theory

This page was built for publication: An algorithm for enumerating difference sets