Related papers: A Dombi Counterexample with Positive Lower Density
Given a natural number $k\ge 2$ and a $k$-automatic set $S$ of natural numbers, we show that the lower density and upper density of $S$ are recursively computable rational numbers and we provide an algorithm for computing these quantities.…
We show that there are sets of integers with asymptotic density arbitrarily close to 1 in which there is no solution to the equation ab=c, with a,b,c in the set. We also consider some natural generalizations, as well as a specific numerical…
In this paper we prove that given two sets $E_1,E_2 \subset \mathbb{Z}$ of positive density, there exists $k \geq 1$ which is bounded by a number depending only on the densities of $E_1$ and $E_2$ such that $k\mathbb{Z} \subset…
Let $a_1$, $a_2$, and $a_3$ be distinct reduced residues modulo $q$ satisfying the congruences $a_1^2 \equiv a_2^2 \equiv a_3^2 \pmod q$. We conditionally derive an asymptotic formula, with an error term that has a power savings in $q$, for…
We show that every set $A$ of natural numbers with positive upper density can be shifted to contain the restricted sumset $\{b_1 + b_2 : b_1, b_2\in B \text{ and } b_1 \neq b_2 \}$ for some infinite set $B \subset A$.
Let $s(n)$ denote the sum of the proper divisors of the natural number $n$. We show that the number of $n \leq x$ such that $s(n)$ is a sum of two squares has order of magnitude $x/\sqrt{\log x}$, which agrees with the count of $n \leq x$…
We prove a quantitative partial result in support of the Dynamical Mordell-Lang Conjecture (also known as the DML conjecture) in positive characteristic. More precisely, we show the following: given a field $K$ of characteristic $p$, given…
A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…
A subset $R$ of integers is a set of Bohr recurrence if every rotation on $\mathbb{T}^d$ returns arbitrarily close to zero under some non-zero multiple of $R$. We show that the set $\{k!\, 2^m3^n\colon k,m,n\in \mathbb{N}\}$ is a set of…
Let $n$ be a positive integer, and let $k$ be a field (of arbitrary characteristic) accessible to symbolic computation. We describe an algorithmic test for determining whether or not a finitely presented $k$-algebra $R$ has infinitely many…
Let $s \geq 3$ be a fixed positive integer and $a_1,\dots,a_s \in \mathbb{Z}$ be arbitrary. We show that, on average over $k$, the density of numbers represented by the degree $k$ diagonal form \[ a_1 x_1^k + \cdots + a_s x_s^k \] decays…
We consider the Anderson model on the multi-dimensional cubic lattice and prove a positive lower bound on the density of states under certain conditions. For example, if the random variables are independently and identically distributed and…
In contrast with the notion of complexity, a set $A$ is called anti-complex if the Kolmogorov complexity of the initial segments of $A$ chosen by a recursive function is always bounded by the identity function. We show that, as for…
Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. Erd\H{o}s…
Let $A$ be a nonempty finite subset of an additive abelian group $G$. Define $A + A := \{a + b : a, b \in A\}$ and $A \dotplus A := \{a + b : a, b \in A~\text{and}~ a \neq b\}$. The set $A$ is called a {\em sum-dominant (SD) set} if $|A +…
A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the…
Let $\alpha>1$ be an irrational number and $k\ge 2$ a positive integer. Let $f(x)$ be a polynomial with positive integer coefficients. Solving a 2001 problem of S\'ark\"ozy on special sequences, Hegyv\'ari proved in 2003 that there exists…
Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…
Let $A$ be a commutative unital $\mathbb{R}$-algebra and let $\rho$ be a seminorm on $A$ which satisfies $\rho(ab)\leq\rho(a)\rho(b)$. We apply T. Jacobi's representation theorem to determine the closure of a $\sum A^{2d}$-module $S$ of $A$…
How small can a set be while containing many configurations? Following up on earlier work of Erd\H os and Kakutani \cite{MR0089886}, M\'ath\'e \cite{MR2822418} and Molter and Yavicoli \cite{Molter}, we address the question in two…