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

非负整数一次同余方程

Non-Negative Integer Linear Congruences

John C. Harris, David L. wehlau

摘要:

考虑多元一次同余方程的所有非负整数解的刻画问题。这个问题可以简化为求解同余式$x_1 + 2x_2 + 3x_3 + ... + (n-1)x_{n-1} \equiv 0 \pmod n$,其中在非负整数中寻找未知数$x_i$的值。我们考虑这个方程的幺半群的解决方案,并证明了一个猜想Elashvili关于这些解决方案的结构。这就产生了一个简单的算法,用于生成方程的大多数(几乎所有)高度不可分解的解。

英文摘要:

We consider the problem of describing all non-negative integer solutions to a linear congruence in many variables. This question may be reduced to solving the congruence $x_1 + 2x_2 + 3x_3 + ... + (n-1)x_{n-1} \equiv 0 \pmod n$ where values of the unknowns, $x_i$, are sought among the non-negative integers. We consider the monoid of solutions of this equation and prove a conjecture of Elashvili concerning the structure of these solutions. This yields a simple algorithm for generating most (conjecturally all) of the high degree indecomposable solutions of the equation.

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

↑