On resolvable Golomb rulers, symmetric configurations and progressive dinner parties

DOI10.1007/S10801-020-01001-XzbMATH Open1484.05026arXiv2004.04088OpenAlexW3118821818MaRDI QIDQ2114780FDOQ2114780

Marco Buratti, D. R. Stinson

Publication date: 15 March 2022

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

Abstract: We define a new type of Golomb ruler, which we term a resolvable Golomb ruler. These are Golomb rulers that satisfy an additional "resolvability" condition that allows them to generate resolvable symmetric configurations. The resulting configurations give rise to progressive dinner parties. In this paper, we investigate existence results for resolvable Golomb rulers and their application to the construction of resolvable symmetric configurations and progressive dinner parties. In particular, we determine the existence or nonexistence of all possible resolvable symmetric configurations and progressive dinner parties having block size at most 13, with nine possible exceptions. For arbitrary block size k, we prove that these designs exist if the number of points is divisible by k and at least k^3.

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

Recommendations

• scientific article
• Resolvable configurations
• New results on modular Golomb rulers, optical orthogonal codes and related structures
• \(g\)-Golomb rulers
• Some new disjoint Golomb rulers

zbMATH Keywords

symmetric configurationsprogressive dinner parties having block size at most 13

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial aspects of block designs (05B05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial aspects of finite geometries (05B25) Other combinatorial number theory (11B75)

Cites Work

• The CRC handbook of combinatorial designs
• Solving a linear equation in a set of integers I
• A review of the available construction methods for Golomb rulers
• On constructions and parameters of symmetric configurations \(v_k\)
• The Number of Cyclic Configurations of Type (v₃) and the Isomorphism Problem
• Finite nets. II: Uniqueness and imbedding
• An inequality for B2-sequences
• Resolvable configurations
• Designing Progressive Dinner Parties
• New results on modular Golomb rulers, optical orthogonal codes and related structures

Cited In (4)

• PIR codes from combinatorial structures
• Some new disjoint Golomb rulers
• Heffter spaces
• Title not available (Why is that?)

This page was built for publication: On resolvable Golomb rulers, symmetric configurations and progressive dinner parties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114780)