$p$-adic denseness of members of partitions of $\mathbb{N}$ and their ratio sets
Piotr Miska, Carlo Sanna

TL;DR
This paper investigates the $p$-adic denseness of ratio sets derived from partitions of natural numbers, establishing bounds on the number of primes for which the ratio sets are dense in $Q_p$ and $Z_p$, with explicit constructions and a negative answer to a prior question.
Contribution
It proves bounds on the number of primes for which ratio sets of partitioned natural numbers are dense in $Q_p$ and $Z_p$, providing explicit constructions and resolving an open question.
Findings
At least one ratio set is dense in $Q_p$ for all but at most $loor{ ext{log}_2 k}$ primes.
At least one set is dense in $Z_p$ for all but at most $k-1$ primes.
Constructed explicit partitions demonstrating the bounds are tight.
Abstract
The ratio set of a set of positive integers is defined as . The study of the denseness of in the set of positive real numbers is a classical topic and, more recently, the denseness in the set of -adic numbers has also been investigated. Let be a partition of into sets. We prove that for all prime numbers but at most exceptions at least one of is dense in . Moreover, we show that for all prime numbers but at most exceptions at least one of is dense in . Both these results are optimal in the sense that there exist partitions having exactly , respectively , exceptional prime numbers; and we give explicit constructions for them.…
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.
