Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
On resolvable Golomb rulers, symmetric configurations and progressive dinner parties
Ist Teil von
Journal of algebraic combinatorics, 2022-02, Vol.55 (1), p.141-156
Ort / Verlag
New York: Springer US
Erscheinungsjahr
2022
Quelle
Alma/SFX Local Collection
Beschreibungen/Notizen
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
.