线性丢番图方程的稀疏解
Sparse solutions of linear Diophantine equations
摘要：
我们提出的解决方案的丢番图系统$A{\boldsymbol y} = {\boldsymbol b}$，${\boldsymbol y} \in \mathbb Z^t_{\ge 0}$与最小数量的非零条目的结构结果。我们的工具是代数和数论的性质，包括西格尔引理，生成函数，和交换代数。这些结果在离散最优化中有一些有趣的结果。
英文摘要：
We present structural results on solutions to the Diophantine system $A{\boldsymbol y} = {\boldsymbol b}$, ${\boldsymbol y} \in \mathbb Z^t_{\ge 0}$ with the smallest number of non-zero entries. Our tools are algebraic and number theoretic in nature and include Siegel's Lemma, generating functions, and commutative algebra. These results have some interesting consequences in discrete optimization.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
