Related papers: Sums of linear transformations

We show that for any positive integer $d$, there are families of switched linear systems---in fixed dimension and defined by two matrices only---that are stable under arbitrary switching but do not admit (i) a polynomial Lyapunov function…

We prove that given $\lambda \in \mathbb{R}$ such that $0 < \lambda < 1$, then $\pi(x + x^\lambda) - \pi(x) \sim \displaystyle \frac{x^\lambda}{\log(x)}$. This solves a long-standing problem concerning the existence of primes in short…

Additive combinatorics asks for lower bounds on sumsets and restricted sumsets over finite fields. Central examples are the Cauchy-Davenport theorem and the Erd\H{o}s-Heilbronn conjecture. In this note, we develop Das's linear algebraic…

Let $n \ge 2$ be an integer and $\alpha_1, \ldots, \alpha_n$ be non-zero algebraic numbers. Let $b_1, \ldots , b_n$ be integers with $b_n \not= 0$, and set $B = \max\{3, |b_1|, \ldots , |b_n|\}$. For $j =1, \ldots, n$, set $h^* (\alpha_j) =…

Let $G$ be an additive abelian group and $h$ be a positive integer. For a nonempty finite subset $A=\{a_0, a_1,\ldots, a_{k-1}\}$ of $G$, we let \[h_{\underline{+}}A:=\{\Sigma_{i=0}^{k-1}\lambda_{i} a_{i}: (\lambda_{0}, \ldots,…

We study the problem of obtaining asymptotic formulas for the sums $\sum_{X < n \leq 2X} d_k(n) d_l(n+h)$ and $\sum_{X < n \leq 2X} \Lambda(n) d_k(n+h)$, where $\Lambda$ is the von Mangoldt function, $d_k$ is the $k^{\operatorname{th}}$…

Let $\{a_1, . . . , a_n\}$ be a set of positive integers with $a_1 < \dots < a_n$ such that all $2^n$ subset sums are distinct. A famous conjecture by Erd\H{o}s states that $a_n>c\cdot 2^n$ for some constant $c$, while the best result known…

Let $\lambda$ denote the Liouville function. A well known conjecture of Chowla asserts that for any distinct natural numbers $h_1,\dots,h_k$, one has $\sum_{1 \leq n \leq X} \lambda(n+h_1) \dotsm \lambda(n+h_k) = o(X)$ as $X \to \infty$.…

Let $\Lambda$ be the von Mangoldt function and $r_{Q}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}\Lambda\left(m_{1}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares (that we will…

Let $\lambda$ denote the Liouville function. We show that for all sufficiently large integers $N$, the (non-trivial) convolution sum bound $$ \left|\sum_{1 \leq n < N} \lambda(n) \lambda(N-n)\right| < N-1 $$ holds. This (essentially)…

For any large prime $q$, $1 \leq x \leq q$ and any real $0 \leq k \leq 1$, we prove an upper bound for the following $2k$-th moment $$\displaystyle \sum_{\substack{\chi \bmod q}} \Big| \sum_{n\leq x} \chi(n)\lambda(n)\Big|^{2k},$$ where…

We prove an asymptotically tight lower bound on $|A+\lambda A|$ for $A\subset \mathbb{C}$ and algebraic integer $\lambda$. The proof combines strong version of Freiman's theorem, structural theorem on dense subsets of a hypercubic lattice…

P. Flajolet and B. Salvy \cite{FS1998} prove the famous theorem that a nonlinear Euler sum $S_{i_1i_2\cdots i_r,q}$ reduces to a combination of sums of lower orders whenever the weight $i_1+i_2+\cdots+i_r+q$ and the order $r$ are of the…

This is a sequel to the paper arXiv:1312.6438 by the same authors. In this sequel, we quantitatively improve several of the main results of arXiv:1312.6438, and build on the methods therein. The main new results is that, for any finite set…

The Kuznecov sum formula, proved by Zelditch in the Riemannian setting, is an asymptotic sum formula $$N(\lambda) := \sum_{\lambda_j \leq \lambda} \left| \int_H e_j \, dV_H \right|^2 = C_{H,M} \lambda^{\operatorname{codim} H} +…

Given lacunary sequence of integers, $n_k$, $n_{k+1}/n_k>\lambda>1$, we define a new sequence $\{m_k\}$ formed by all possible $l$-wise sums $\pm n_{k_1}\pm n_{k_2}\pm \ldots\pm n_{k_l}$. We prove if $\lambda>\lambda_l$, then any series…

We show that for any coprime integers $\lambda_1 , \ldots , \lambda_k$ and any finite $A \subset \mathbb{Z}$, one has $$|\lambda_1 \cdot A + \ldots + \lambda_k \cdot A| \geq (|\lambda_1| + \ldots + |\lambda_k|)|A|- C,$$ where $C$ only…

Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, resp.) proof-nets admits a guaranteed polynomial…

Suppose that $\{a_j\}\in \ell^1$, and suppose that for any sequence $(t_n)$ of integers there exits a constant $C_1>0$ such that $$\sharp\left\{k\in\mathbb{Z}:\sup_{n\geq 1}\left|\sum_{i\in \mathcal{B}_n-t_n}…

This paper presents a lower bound for optimizing a finite sum of $n$ functions, where each function is $L$-smooth and the sum is $\mu$-strongly convex. We show that no algorithm can reach an error $\epsilon$ in minimizing all functions from…