Search arXivSearch

arXiv · 2411.08139

Visualizing the Sum-Product Conjecture

Abstract

Let $SPP(n)$ be the set $\left\{\big(|A+A|,|A A|\big) : A\subseteq {\mathbb N}, |A|=n\right\}$ of sum-product pairs, where $A+A$ is the sumset $\{a+b : a,b\in A\}$ and $A A$ is the product set $\{ab:a,b\in A\}$. We construct a dataset consisting of 1162868 sets whose sum-product pairs are at least $84\%$ of $SPP(n)$ for each $n\le 32$. Notably, we do **not** see evidence in favor of Erdős's Sum-Product Conjecture in our dataset. For $n\le 6$, we prove the exact value of $SPP(n)$. We include a number of conjectures, open problems, and observations motivated by this dataset, a large number of color visualizations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kevin O'Bryant. 2025-03-16. Visualizing the Sum-Product Conjecture. https://arxiv.org/abs/2411.08139

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT