Related papers: On Asymptotic Approximate Groups of Integers

For positive integers $n$, $m$, and $h$, we let $\rho \hat{\;}(\mathbb{Z}_n, m, h)$ denote the minimum size of the $h$-fold restricted sumset among all $m$-subsets of the cyclic group of order $n$. The value of $\rho \hat{\;}(\mathbb{Z}_n,…

For $r \in [0,1]$ we say that a set $A \subseteq \omega$ is \emph{coarsely computable at density} $r$ if there is a computable set $C$ such that $\{n : C(n) = A(n)\}$ has lower density at least $r$. Let $\gamma(A) = \sup \{r : A \hbox{ is…

An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subset T of the n-set is contained in at least one special S with |S| - |T| <= R. In this paper we compute the smallest size of any D(n,1) for n…

In this paper we show that every set $A \subset \mathbb{N}$ with positive density contains $B+C$ for some pair $B,C$ of infinite subsets of $\mathbb{N}$, settling a conjecture of Erd\H{o}s. The proof features two different decompositions of…

Merging together a result of Nathanson from the early 70s and a recent result of Granville and Walker, we show that for any finite set $A$ of integers with $\min(A)=0$ and $\gcd(A)=1$ there exist two sets, the "head" and the "tail", such…

We use the convolution method for arithmetic functions of several variables to deduce an asymptotic formula for the number of $k$-tuples of positive integers with components which are pairwise non-coprime and $\le x$. More generally, we…

We consider the problem of counting $k$-tuples of positive integers satisfying any arbitrary set of gcd conditions, where every integer is not larger than $x$. We first establish the conditions to guarantee the existence of such tuples, and…

Let $X$ be a closed equidimensional local complete intersection subscheme of a smooth projective scheme $Y$ over a field, and let $X_t$ denote the $t$-th thickening of $X$ in $Y$. Fix an ample line bundle $\mathcal{O}_Y(1)$ on $Y$. We prove…

Let $G$ be a graph and $\Gamma$ a finite abelian group. The zero-sum Ramsey number of $G$ over $\Gamma$, denoted by $R(G, \Gamma)$, is the smallest positive integer $t$ (if it exists) such that any edge-colouring $c:E(K_t)\to\Gamma$…

We consider the set $A_{n}=\displaystyle\cup_{j=0}^{\infty}\{\varepsilon_{j}(n)\cdot n^j\colon\varepsilon_{j}(n)\in\{0,\pm1,\pm2,...,\pm\lfloor{{n}/{2}}\rfloor\}\} $. Let $\mathcal{S}_{\mathcal{A}}= \bigcup_{a \in\mathcal{A} } A_{a}$ where…

Tur\'{a}n's theorem is a cornerstone of extremal graph theory. It asserts that for any integer $r \geq 2$ every graph on $n$ vertices with more than ${\tfrac{r-2}{2(r-1)}\cdot n^2}$ edges contains a clique of size $r$, i.e., $r$ mutually…

Landau function $g(n)$ is the maximal possible least common multiple of several positive integers with sum not exceeding $n$. Under additional assumptions that these numbers are the differences of disjoint bi-infinite arithmetic…

Consider a simple graph $G=(V,E)$ of maximum degree $\Delta$ and its proper total colouring $c$ with the elements of the set $\{1,2,\ldots,k\}$. The colouring $c$ is said to be \emph{neighbour sum distinguishing} if for every pair of…

For a subset A of a finite abelian group G we define Sigma(A)={sum_{a\in B}a:B\subset A}. In the case that Sigma(A) has trivial stabiliser, one may deduce that the size of Sigma(A) is at least quadratic in |A|; the bound |Sigma(A)|>=…

For an integer $r\geq 2$ and bipartite graphs $H_i$, where $1\leq i\leq r$, the bipartite Ramsey number $br(H_1,H_2,\ldots,H_r)$ is the minimum integer $N$ such that any $r$-edge coloring of the complete bipartite graph $K_{N,N}$ contains a…

A set $A$ is MSTD (more-sum-than-difference) if $|A+A|>|A-A|$. Though MSTD sets are rare, Martin and O'Bryant proved that there exists a positive constant lower bound for the proportion of MSTD subsets of $\{1,2,\ldots ,r\}$ as…

Given positive integers $a_1,\ldots,a_k$, we prove that the set of primes $p$ such that $p \not\equiv 1 \bmod{a_i}$ for $i=1,\ldots,k$ admits asymptotic density relative to the set of all primes which is at least $\prod_{i=1}^k…

The existence of unimodular forms with small norms on sequence spaces is crucial in a variety of problems in modern analysis. We prove that the infimum of $\left\Vert A\right\Vert $ over all unimodular $d$-linear (complex or real) forms $A$…

Let $A, B$ be finite subsets of a torsion-free group $G$. We prove that for every positive integer $k$ there is a $c(k)$ such that if $|B|\ge c(k)$ then the inequality $|AB|\ge |A|+|B|+k$ holds unless a left translate of $A$ is contained in…

The strong chromatic number $\chi_{\text{s}}(G)$ of a graph $G$ on $n$ vertices is the least number $r$ with the following property: after adding $r \lceil n/r \rceil - n$ isolated vertices to $G$ and taking the union with any collection of…