arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2601.03212math.NT
收藏

格覆盖与均质覆盖同余

Lattice coverings and homogeneous covering congruences

University of Warwick(华威大学);Universiteit Utrecht(乌得勒支大学)

J. E. Cremona, P. Koymans

AI总结:

研究通过构造极小覆盖解决格覆盖问题,并确定最多8个子格的极小覆盖。

摘要:

我们考虑用有限个有限指数子格覆盖 $\mathbb{Z}^2$,并满足一个简单的极小性或非退化条件的问题。我们展示了这个问题可以被视为一个项目性(或均质)版本的著名同余覆盖系统问题。我们给出了一个构造极小覆盖的构造,该构造产生了许多但并非所有的极小覆盖,并确定了最多8个子格的极小覆盖。

英文摘要:

We consider the problem of covering $\mathbb{Z}^2$ with a finite number of sublattices of finite index; this 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, prove an inequality relating the size of a covering to the least common multiple of the lattice indices, and determine all minimal coverings with at most $8$ sublattices.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑