S-unit equations in modules and linear-exponential Diophantine equations
Ruiwen Dong, Doron Shafrir

TL;DR
This paper studies solutions to S-unit equations over modules in Laurent polynomial rings, establishing effective bounds and decidability results, which connect to deep problems in number theory and potential applications in algebra and automata theory.
Contribution
It generalizes known results on S-unit equations to modules over Laurent polynomial rings and links the decidability of these equations to solving linear-exponential Diophantine systems.
Findings
Solution sets are effectively p-normal for T as a prime power
Decidability is equivalent to solving certain linear-exponential Diophantine equations
Decidability is proven for T with at most two prime divisors
Abstract
Let be a positive integer, and be a finitely presented module over the Laurent polynomial ring . We consider S-unit equations over : these are equations of the form , where the variables range over the set of monomials (with coefficient 1) of . When is a power of a prime number , we show that the solution set of an S-unit equation over is effectively -normal in the sense of Derksen and Masser (2015), generalizing their result on S-unit equations in fields of prime characteristic. When is an arbitrary positive integer, we show that deciding whether an S-unit equation over admits a solution is Turing equivalent to solving a system of linear-exponential Diophantine…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation
