Arithmetic Nullstellensatz and Nonstandard Methods
Haydar G\"oral (ICJ)

TL;DR
This paper establishes height bounds for polynomial rings over various domains using nonstandard methods, with applications to primality testing and factorization, despite the bounds being ineffective.
Contribution
It introduces nonstandard techniques to derive height bounds in polynomial rings over integral domains and algebraic numbers, extending to valuation rings and arithmetical functions.
Findings
Height bounds for polynomial rings over integral domains.
Application of bounds to primality testing of ideals.
Analysis of bounds in UFDs and valuation rings.
Abstract
In this study we find height bounds for polynomial rings over integral domains. We apply nonstandard methods and hence our constants will be ineffective. Then we find height bounds in the polynomial ring over algebraic numbers to test primality of an ideal. Furthermore we consider unique factorization domains and possible bounds for valuation rings and arithmetical functions.
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
TopicsMathematical and Theoretical Analysis · Polynomial and algebraic computation · Rings, Modules, and Algebras
