Related papers: Nearly subadditive sequences
The following extension of Bohr's theorem is established: If a somewhere convergent Dirichlet series $f$ has an analytic continuation to the half-plane $\mathbb{C}_\theta = \{s = \sigma+it\,:\, \sigma>\theta\}$ that maps $\mathbb{C}_\theta$…
We obtain positive lower bounds on the Hausdorff dimension of sets of real numbers given by expressions of the form $\sum_{n=1}^\infty \frac{1}{a_n b_n}$, where $b_n$ satisfies some growth condition and $a_n$ lies in some set, possibly…
Given two subsets $A, B \subseteq \mathbb{F}_p$ and a binary relation $\mathcal{R} \subseteq A \times B$, the restricted sumset of $A, B$ with respect to $\mathcal{R}$ is defined as $A +_{\mathcal{R}} B = \{ a+b \colon (a,b) \notin…
Let $f^{(r)}(n;s,k)$ be the maximum number of edges in an $n$-vertex $r$-uniform hypergraph not containing a subhypergraph with $k$ edges on at most $s$ vertices. Recently, Delcourt and Postle, building on work of Glock, Joos, Kim,…
A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…
Assume that a convergent series of real numbers $\sum\limits_{n=1}^\infty a_n$ has the property that there exists a set $A\subseteq \N$ such that the series $\sum\limits_{n \in A} a_n$ is conditionally convergent. We prove that for a given…
We state and prove a generalization of Kingman's ergodic theorem on a measure-preserving dynamical system $(X,\mathcal{F},\mu,T)$ where the $\mu$-almost sure subadditivity condition $f_{n+m} \leq f_n + f_m \circ T^{n}$ is relaxed to a…
Let $E \subseteq R^n$ be a closed set of Hausdorff dimension $\alpha$. For $m \geq n$, let $\{B_1,\ldots,B_k\}$ be $n \times (m-n)$ matrices. We prove that if the system of matrices $B_j$ is non-degenerate in a suitable sense, $\alpha$ is…
The Bollob\'as set pairs inequality is a fundamental result in extremal set theory with many applications. In this paper, for $n \geq k \geq t \geq 2$, we consider a collection of $k$ families $\mathcal{A}_i: 1 \leq i \leq k$ where…
We prove that the Hausdorff dimension of the set $\mathbf{x}\in [0,1)^d$, such that $$ \left|\sum_{n=1}^N \exp\left(2 \pi i\left(x_1n+\ldots+x_d n^d\right)\right) \right|\ge c N^{1/2} $$ holds for infinitely many natural numbers $N$, is at…
We generalize a classical theorem of Besicovitch, showing that, for any positive integers $k<n$, if $E\subset \mathbb R^n$ is a Souslin set which is not $\mathcal{H}^k$-$\sigma$-finite, then $E$ contains a purely unrectifiable closed set…
Let $(m, n, k)$ be a tuple of integers with the property that if $i \leq k$, then $m + i$ and $n + i$ have the same radical. Using a result on the abc Conjecture, we bound $k$ from above, improving a result of Balasubramanian, Shorey, and…
Given $\beta\in(1,2)$ and $x\in[0,\frac{1}{\beta-1}]$, a sequence $(\epsilon_{i})_{i=1}^{\infty}\in\{0,1\}^{\mathbb{N}}$ is called a $\beta$-expansion for $x$ if $$x=\sum_{i=1}^{\infty}\frac{\epsilon_{i}}{\beta^{i}}.$$ In a recent article…
We study the classic set cover problem from the perspective of sub-linear algorithms. Given access to a collection of $m$ sets over $n$ elements in the query model, we show that sub-linear algorithms derived from existing techniques have…
We study a long standing conjecture on the necessary and sufficient conditions for the compatibility of multi-state characters: There exists a function $f(r)$ such that, for any set $C$ of $r$-state characters, $C$ is compatible if and only…
We introduce a simple sieve-theoretic approach to studying partial sums of multiplicative functions which are close to their mean value. This enables us to obtain various new results as well as strengthen existing results with new proofs.…
In this paper, we establish an extension of a noncommutative Bennett inequality with a parameter $1\leq r\leq2$ and use it together with some noncommutative techniques to establish a Rosenthal inequality. We also present a noncommutative…
In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…
Fix an integer $h \geq 2$, and let $b_1, \ldots, b_h$ be (not necessarily distinct) positive integers with $\gcd(b_1, \ldots, b_h) = 1$. For any subset $A \subseteq \mathbb{N}$, let $r_A(n)$ denote the number of solutions $(k_1, \ldots,…
Let $f\colon\mathbb{N}\rightarrow\mathbb{C}$ be an arithmetic function and consider the Beatty set $\mathcal{B}(\alpha) = \lbrace\, \lfloor n\alpha \rfloor : n\in\mathbb{N} \,\rbrace$ associated to a real number $\alpha$, where…