arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2208.09720math.NT
收藏

关于同余覆盖系的计算与观测结果

Computations and observations on congruence covering systems

Raj Agrawal, Prarthana Bhatia, Kratik Gupta, Powers Lamb, Andrew Lott, Alex Rice, Christine Rose Ward

AI总结:

该研究针对同余覆盖系领域,完成了模数不超过10的不同模覆盖系的完整分类,并据此得出所有模大于2的不同模覆盖系的最小基数为11的结论。

摘要:

$\textit{覆盖系}$是一组整数同余式,满足每个整数都至少符合该组中的一个同余式。若覆盖系的所有模均互不相同,则称其为$\textit{不同模覆盖系}$。自Erdős提出覆盖系概念以来,相关领域已涌现大量研究文献。本文基于两种等价形式,对模的数量不超过10的不同模覆盖系进行了完整分类。作为推论,我们确定了所有模均大于$2$的不同模覆盖系的最小基数为11。

英文摘要:

A $\textit{covering system}$ is a collection of integer congruences such that every integer satisfies at least one congruence in the collection. A covering system is called $\textit{distinct}$ if all of its moduli are distinct. An expansive literature has developed on covering systems since their introduction by Erdős. Here we provide a full classification of distinct covering systems with at most ten moduli, which we group together based on two forms of equivalence. As a consequence, we determine the minimum cardinality of a distinct covering system with all moduli exceeding $2$, which is $11$.

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

↑