Search arXivSearch

arXiv · 2101.01034

Sidon sets for linear forms

Also available from

Abstract

Let $φ(x_1,\ldots, x_h) = c_1 x_1 + \cdots + c_h x_h $ be a linear form with coefficients in a field $\mathbf{F}$, and let $V$ be a vector space over $\mathbf{F}$. A nonempty subset $A$ of $V$ is a $φ$-Sidon set if, for all $h$-tuples $(a_1,\ldots, a_h) \in A^h$ and $ (a'_1,\ldots, a'_h) \in A^h$, the relation $φ(a_1,\ldots, a_h) = φ(a'_1,\ldots, a'_h)$ implies $(a_1,\ldots, a_h) = (a'_1,\ldots, a'_h)$. There exist infinite Sidon sets for the linear form $φ$ if and only if the set of coefficients of $φ$ has distinct subset sums. In a normed vector space with $φ$-Sidon sets, every infinite sequence of vectors is asymptotic to a $φ$-Sidon set of vectors. Results on $p$-adic perturbations of $φ$-Sidon sets of integers and bounds on the growth of $φ$-Sidon sets of integers are also obtained.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Melvyn B. Nathanson. 2021-11-11. Sidon sets for linear forms. https://doi.org/10.1016/j.jnt.2021.08.005

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