A non-analytic proof of the Newman-Znám result for disjoint covering systems
From MaRDI portal
Publication:1086272
DOI10.1007/BF02579384zbMath0608.10006MaRDI QIDQ1086272
Alexander Felzenbaum, Aviezri S. Fraenkel, Marc A. Berger
Publication date: 1986
Published in: Combinatorica (Search for Journal in Brave)
arithmetic progressioncombinatorial proofmaximal modulusdisjoint covering systemlattice parallelotopes
Congruences; primitive roots; residue systems (11A07) Lattice packing and covering (number-theoretic aspects) (11H31) Arithmetic progressions (11B25) Linear incidence geometric structures with parallelism (51A15) Combinatorial aspects of packing and covering (05B40)
Related Items
Lattice parallelotopes and disjoint covering systems, New results for covering systems of residue sets, Covers of product sets and the Korec-Znám result, The use and usefulness of numeration systems, Boolean Function Analogs of Covering Systems, Rigidity and the chessboard theorem for cube packings, Beatty sequences and Langford sequences, Iterated Floor Function, Algebraic Numbers, Discrete Chaos, Beatty Subsequences, Semigroups, Disjoint covering systems of rational Beatty sequences, The structure of cube tilings under symmetry conditions, Unnamed Item, Irreducible disjoint covering systems (with an application to Boolean algebra)
Cites Work
