Lattice coverings and homogeneous covering congruences
Number Theory
2026-01-15 v2
Abstract
We consider the problem of covering with a finite number of sublattices of finite index, satisfying a simple minimality or non-degeneracy condition. We show how this problem may be viewed as a projective (or homogeneous) version of the well-known problem of covering systems of congruences. We give a construction of minimal coverings which produces many, but not all, minimal coverings, and determine all minimal coverings with at most sublattices.
Cite
@article{arxiv.2601.03212,
title = {Lattice coverings and homogeneous covering congruences},
author = {J. E. Cremona and P. Koymans},
journal= {arXiv preprint arXiv:2601.03212},
year = {2026}
}
Comments
Minor corrections