Erd\H{o}s--Tur\'an Theorem and Eulerian Integers
Erik F\"uredi, Katalin Gyarmati

TL;DR
This paper explores the relationships between Eulerian integers, prime divisors, and product sums, establishing lower bounds on the number of prime divisors for certain products and extending Erdős–Turán type results to Eulerian integers.
Contribution
It generalizes Erdős–Turán theorem bounds to Eulerian integers and related polynomial products, providing new lower bounds and computational results.
Findings
Lower bounds of order log|A| for prime divisors in products over Eulerian integers.
Extension of Erdős–Turán theorem to Eulerian integers and polynomial products.
Computational bounds for small sets and specific polynomial forms.
Abstract
Our work is motivated by the fact that the norms of the Eulerian integers are related to the sums of form , providing a natural generalization for problems concerning products over sums or differences of integers. Let be the set of Eulerian integers. We define as the number of distinct prime divisors of , and as the number of distinct Euler prime divisors of . By the Erd\H{o}s--Tur\'an theorem, if and (), then . We prove that if is a finite set and , then the value of has a lower bound of order . Consequently, we provide lower bounds for $\mathcal{A}…
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
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Algebraic Geometry and Number Theory
