多项式模合数:解集结构的Ax-Katz型定理
Polynomials Modulo Composite Numbers: Ax-Katz type theorems for the structure of their solution sets
摘要:
本文将有限域上的单多项式的Ax-Katz定理推广到m复合环Z_m上。这种扩展不仅产生类似的结果,但显着更高的整除界限。我们猜想计算机运行的结果是对任意m的最优结果,并证明了它的一个特例,即m = 2^r和2次多项式。我们的结果也产生进一步的性质的解决方案空间。模复合多项式是某些计算复杂性下限前沿的焦点,而模2^r多项式则出现在量子电路的模拟中。最后给出了本研究的一些应用前景。
英文摘要:
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer runs suggest is the optimal result for any m, and prove a special case of it. The special case is for m = 2^r and polynomials of degree 2. Our results also yield further properties of the solution spaces. Polynomials modulo composites are the focus of some computational complexity lower bound frontiers, while those modulo 2^r arise in the simulation of quantum circuits. We give some prospective applications of this research.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。