Related papers: Additive Complements for a given Asymptotic Densit…

Let $b > a > 0$. We prove the following asymptotic formula $$\sum_{n\ge 0} \big\lvert\{x/(n+a)\} - \{x/(n+b)\}\big\rvert = \frac{2}{\pi}\zeta(3/2)\sqrt{cx} + O(c^{2/9}x^{4/9}),$$ with $c=b-a$, uniformly for $x \ge 40 c^{-5}(1+b)^{27/2}$.

Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define…

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…

Let $\delta > 1/2$. We prove that if $A$ is a subset of the primes such that the relative density of $A$ in every reduced residue class is at least $\delta$, then almost all even integers can be written as the sum of two primes in $A$. The…

Starting out from results known for the most classical cases of N, Z^d, R^d or for sigma-finite abelian groups, here we define the notion of asymptotic uniform upper density in general locally compact abelian groups. Even if a bit…

We study a chromatic theory of asymptotic approximate groups for tuples of subsets of abelian groups, combining Nathanson's chromatic sumset formalism with asymptotic covering ideas from approximate group theory. This framework encodes…

We prove that for all $k,m,n \in \mathbb N \cup \{\infty\}$ with $4 \leq k \leq m \leq n$, there exists a finitely generated group $G$ with a finitely generated subgroup $H$ such that the asymptotic dimension of $G$ is $k$, the…

For fixed integers $b\geq k$, a problem of relevant interest in computer science and combinatorics is that of determining the asymptotic growth, with $n$, of the largest set for which a $(b, k)$-hash family of $n$ functions exists.…

Landau's theorem asserts that the asymptotic density of sums of two squares in the interval $1\leq n\leq x$ is $K/{\sqrt{\log x}}$, where $K$ is the Landau-Ramanujan constant. It is an old problem in number theory whether the asymptotic…

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of…

This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…

We consider the asymptotic properties of Approximate Bayesian Computation (ABC) for the realistic case of summary statistics with heterogeneous rates of convergence. We allow some statistics to converge faster than the ABC tolerance, other…

We investigate some variants of the splitting, reaping, and independence numbers defined using asymptotic density. Specifically, we give a proof of Con($\mathfrak{i}<\mathfrak{s}_{1/2}$), Con($\mathfrak{r}_{1/2}<\mathfrak{b}$) and…

In this paper we study asymptotic density of rational sets in free abelian group $\mathbb{Z}^n$ of rank $n$. We show that any rational set $R$ in $\mathbb{Z}^n$ has asymptotic density. If $R$ is given by its semi-simple decomposition we…

Every set $A$ of positive integers with upper Banach density 1 contains an infinite sequence of pairwise disjoint subsets $(B_i)_{i=1}^{\infty}$ such that $B_i$ has upper Banach density 1 for all $i \in \mathbf{N}$ and $\sum_{i\in I} B_i…

Let $X=\sum_{k=1}^\infty X_k \beta^{-k}$ be the base-$\beta$ expansion of a continuous random variable $X$ on the unit interval where $\beta$ is the golden ratio. We study the asymptotic distribution and convergence rate of the scaled…

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = A+A = \{a + b \ | \ a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. We prove that the number of sumsets in $\mathbb{F}_2^n$ is asymptotically…

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

For a positive integer $n$, let $[n]$ denote $\{1, \ldots, n\}$. For a 2-dimensional integer lattice point $\mathbf{b}$ and positive integers $k\geq 2$ and $n$, a \textit{$k$-sum $\mathbf{b}$-free set} of $[n]\times [n]$ is a subset $S$ of…

Since addition is commutative but subtraction is not, the sumset S+S of a finite set S is predisposed to be smaller than the difference set S-S. In this paper, however, we show that each of the three possibilities (|S+S|>|S-S|, |S+S|=|S-S|,…