Sets in \(\mathbb{Z}_n\) with distinct sums of pairs.

DOI10.1016/S0166-218X(03)00273-7zbMath1035.05021MaRDI QIDQ1428557

Patric R. J. Östergård, Harri Haanpää, Antti Huima

Publication date: 29 March 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

packingcyclic groupsdifference setbacktrack algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Additive bases, including sumsets (11B13) Combinatorial aspects of packing and covering (05B40)

Related Items

On constructions and parameters of symmetric configurations \(v_k\) ⋮ Sets in Abelian groups with distinct sums of pairs. ⋮ On Finding Small 2-Generating Sets ⋮ Klein cordial trees and odd cyclic cordial friendship graphs ⋮ Some algorithmic results for [2-sumset covers] ⋮ Note on the group edge irregularity strength of graphs ⋮ Harmonious order of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite geometry and character theory
• Cyclic difference sets
• A new table of constant weight codes
• Lower bounds for constant weight codes
• On Additive Bases and Harmonious Graphs
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• A new algorithm for Golomb ruler derivation and proof of the 19 mark ruler