2012/10/05 by Haydar Göral, Göral, Haydar
Computer Science · Mathematics · #FOS: Mathematics #Logic (math.LO) #Mathematical and Theoretical Analysis #Polynomial and algebraic computation #Rings, Modules, and Algebras #math.LO
paper · pdf · doi:10.48550/arxiv.1210.1651
openalex publication_date 2012/10/05 · arxiv created 2014/05/26 · arxiv updated 2014/05/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.