Related papers: Product-free sets with high density

In this paper some links between the density of a set of integers and the density of its sumset, product set and set of subset sums are presented.

A numerical set is a co-finite subset of the natural numbers that contains zero. Its Frobenius number is the largest number in its complement. Each numerical set has an associated semigroup $A(T)=\{t\mid t+T\subseteq T\}$, which has the…

It is known that the asymptotic density of states of a 2d CFT in an irreducible representation $\rho$ of a finite symmetry group $G$ is proportional to $(\dim\rho)^2$. We show how this statement can be generalized when the symmetry can be…

Abstract upper densities are monotone and subadditive functions from the power set of positive integers to the unit real interval that generalize the upper densities used in number theory, including the upper asymptotic density, the upper…

In this note, we look at the diophantine equation $$ \prod_{i=1}^ta_i!=\prod_{j=1}^sn_i!, \quad n_1\geq \cdots \geq n_s\geq 2 \quad \textnormal{and}\quad n_1>a_1\geq a_2\geq\cdots \geq a_t\geq2. $$ \noindent Let $s<t$. Under the (explicit)…

We present an elementary combinatorial argument showing that the density of a progression-free set in a finite r-dimensional vector space is O(1/r).

We show that the set of the numbers that are the sum of a prime and a Fibonacci number has positive lower asymptotic density.

Let $\mathcal{A}$ denote a finite set of arithmetic progressions of positive integers and let $s \geq 2$ be an integer. If the cardinality of $\mathcal{A}$ is at least 2 and $U$ is the union formed by taking certain arithmetic progressions…

A subset $A$ of a group $G$ is called product-free if there is no solution to $a=bc$ with $a,b,c$ all in $A$. It is easy to see that the largest product-free subset of the symmetric group $S_n$ is obtained by taking the set of all odd…

The paper solves the problems of determining the asymptotics of the number of primes and the sums of functions of primes in a subset of the natural series that satisfies the conditions that the asymptotic density of the number of primes in…

We define the direct sum of a countable family of pointed metric spaces in a way resembling the direct sum of groups. Then we prove that if a family consists of $0$-hyperbolic (in the sense of Gromov) and $D$-discrete spaces, then its…

In a previous work, Bettin, Koukoulopoulos, and Sanna prove that if two sets of natural numbers $A$ and $B$ have natural density $1$, then their product set $A \cdot B := \{ab : a \in A, b \in B\}$ also has natural density $1$. They also…

We develop an analytic approach that draws on tools from Fourier analysis and ergodic theory to study Ramsey-type problems involving sums and products in the integers. Suppose $Q$ denotes a polynomial with integer coefficients. We establish…

Fix $A$, a family of subsets of natural numbers, and let $G_A(n)$ be the maximum cardinality of a subset of $\{1,2,..., n\}$ that does not have any subset in $A$. We consider the general problem of giving upper bounds on $G_A(n)$ and give…

We classify the asymptotic densities of the $\Delta^0_2$ sets according to their level in the Ershov hierarchy. In particular, it is shown that for $n \geq 2$, a real $r \in [0,1]$ is the density of an $n$-c.e.\ set if and only if it is a…

For a nonnegative integer $t$, let $c_t$ be the asymptotic density of natural numbers $n$ for which $s(n + t) \geq s(n)$, where $s(n)$ denotes the sum of digits of $n$ in base $2$. We prove that $c_t > 1/2$ for $t$ in a set of asymptotic…

Abstract upper densities are monotone and subadditive functions from the power set of positive integers into the unit real interval that generalize the upper densities used in number theory, including the upper asymptotic density, the upper…

Given a linear equation $\mathcal{L}$, a set $A$ of integers is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. This notion incorporates many central topics in combinatorial number theory such as…

Let $0\le \alpha \le \beta\le 1$. For any finite set $B\subset\mathbb{N}$, we show that there exists a set $A\subset\mathbb{N}$ such that $\underline{d}(A+B) = \alpha$ and $\bar{d}(A+B) = \beta$, where $\underline{d}(A+ B)$ and…

Let $F$ and $G$ be integer polynomials where $F$ has degree at least $2$. Define the sequence $(a_n)$ by $a_n=F(a_{n-1})$ for all $n\ge 1$ and $a_0=0.$ Let $\mathscr{B}_{F,\,G,\,k}$ be the set of all positive integers $n$ such that $k\mid…