English
Related papers

Related papers: Lower bound for cyclic sums of Diananda type

200 papers

Let $\lambda$ denote the Liouville function. We prove that $$\sum_{X \leq x < 2X} \sup_{\alpha \in \mathbb{R}/\mathbb{Z}} \bigg\lvert\!\sum_{x \leq n < x+H} \lambda(n) e(n\alpha)\bigg\rvert = o(HX)$$ as $X\to \infty$, in the regime $H =…

Number Theory · Mathematics 2026-04-30 Cédric Pilatte

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…

Number Theory · Mathematics 2017-08-24 Marco Cantarini

For every positive integer $n$ and every $\delta \in [0,1]$, let $B(n, \delta)$ denote the probabilistic model in which a random set $A \subseteq \{1, \dots, n\}$ is constructed by choosing independently every element of $\{1, \dots, n\}$…

Number Theory · Mathematics 2020-12-15 Carlo Sanna

If $G$ is a finite Abelian group, define $s_{k}(G)$ to be the minimal $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. Recently Bitz et al. proved that if $n = exp(G)$, then…

Combinatorics · Mathematics 2017-12-07 Jesse Geneson

Let $G$ be a finite group. Let $K/k$ be a Galois extension of number fields with Galois group isomorphic to $G$, and let $C \subseteq \mathrm{Gal}(K/k) \simeq G$ be a conjugacy invariant subset. It is well known that there exists an…

Number Theory · Mathematics 2026-01-01 Peter J. Cho , Robert J. Lemke Oliver , Asif Zaman

In this note we give a short and self-contained proof that, for any $\delta > 0$, $\sum_{x \leq n \leq x+x^\delta} \lambda(n) = o(x^\delta)$ for almost all $x \in [X, 2X]$. We also sketch a proof of a generalization of such a result to…

Number Theory · Mathematics 2015-02-10 Kaisa Matomäki , Maksym Radziwiłł

Cusick's conjecture on the binary sum of digits $s(n)$ of a nonnegative integer $n$ states the following: for all nonnegative integers $t$ we have \[ c_t=\lim_{N\rightarrow\infty}\frac 1N\left\lvert\{n<N:s(n+t)\geq s(n)\}\right\rvert>1/2.…

Number Theory · Mathematics 2019-04-19 Lukas Spiegelhofer

Let $a \geq 2$ be an integer. We prove that for every periodic sequence $(s_n)_{n \geq 1}$ in $\{-1, +1\}$ there exists an effectively computable rational number $C_\mathbf{s} > 0$ such that \begin{equation*} \log\operatorname{lcm}(a + s_1,…

Number Theory · Mathematics 2021-03-16 Carlo Sanna

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

Number Theory · Mathematics 2016-11-16 Aleksandar Ivić

For $\left(C(t)\right)_{t\in\mathbb R}$ being a cosine family on a unital normed algebra, we show that the estimate $\limsup_{t\to\infty^{+}}\|C(t) - I\| <2$ implies that $C(t)=I$ for all $t\in\mathbb R$. This generalizes the result that…

Functional Analysis · Mathematics 2015-04-10 Felix L. Schwenninger , Hans Zwart

We prove a conjecture of Dukes and Herke concerning the possible orders of a basis for the cyclic group Z_n, namely : For each k \in N there exists a constant c_k > 0 such that, for all n \in N, if A \subseteq Z_n is a basis of order…

Number Theory · Mathematics 2009-07-04 Peter Hegarty

Let X,X_1,X_2,... be independent identically distributed random variables and let h(x,y)=h(y,x) be a measurable function of two variables. It is shown that the bounded law of the iterated logarithm, $\limsup_n (n\log\log n)^{-1}|\sum_{1<=…

Probability · Mathematics 2014-11-17 Evarist Giné , Stanisław Kwapień , Rafał Latała , Joel Zinn

A lower bound is derived for the boundary entropy s = ln g of a 1+1d quantum critical system with boundary, under the conditions that the bulk conformal central charge c is >=1 and the most relevant bulk scaling dimension is >(c-1)/12. This…

High Energy Physics - Theory · Physics 2015-06-05 Daniel Friedan , Anatoly Konechny , Cornelius Schmidt-Colinet

We prove that the cyclic inequality $\sum\limits_{i=1}^{i=n}\left(\frac{x_i}{x_{i+1}}\right)^k\geq\sum\limits_{i=1}^{i=n}\frac{x_i}{x_{\sigma(i)}}$ holds for $k$ in a specific range dependant on the permutation $\sigma$. We also show that…

Combinatorics · Mathematics 2021-09-07 Andrzej Czarnecki , Gabriel Kiciński

We derive some new results on the k-th barycentric Olson constants of abelian groups (mainly cyclic). This quantity, for a finite abelian (additive) group (G,+), is defined as the smallest integer l such that each subset A of G with at…

Number Theory · Mathematics 2013-06-20 Oscar Ordaz , Alain Plagne , Wolfgang A. Schmid

We prove a lower bound $\Omega\left(\frac{k+l}{k^2l^2}N^{2-\frac{k+l+2}{kl}}\right)$ on the maximal possible weight of a $(k,l)$-free (that is, free of all-ones $k\times l$ submatrices) Boolean circulant $N \times N$ matrix. The bound is…

Computational Complexity · Computer Science 2017-01-31 M. I. Grinchuk , I. S. Sergeev

We prove that, for any finite set $A \subset \mathbb Q$ with $|AA| \leq K|A|$ and any positive integer $k$, the $k$-fold product set of the shift $A+1$ satisfies the bound $$| \{(a_1+1)(a_2+1) \cdots (a_k+1) : a_i \in A \}| \geq…

Number Theory · Mathematics 2019-05-22 Brandon Hanson , Oliver Roche-Newton , Dmitrii Zhelezov

Let $D$ be a set of positive integers. A $D$-diffsequence of length $k$ is a sequence of positive integers $a_1 < \cdots < a_k$ such that $a_{i+1}-a_i\in D$ for $i=1,\ldots,k-1$. For $D=\{2^i\mid i\in \mathbb{Z}_{\ge 0}\}$, it is known that…

Combinatorics · Mathematics 2025-09-01 Kanav Talwar , Utkarsh Gupta

In [Yan22a], we defined so-called ``log-type" GCD sums and proved the lower bounds $\Gamma^{(\ell)}_1(N) \gg_{\ell} \left(\log\log N\right)^{2+2\ell}$. We will establish the upper bounds $\Gamma^{(\ell)}_1(N)\ll_{\ell} \left(\log \log…

Number Theory · Mathematics 2023-07-06 Daodao Yang

We present an infinite family of finite planar graphs $\{X_n\}$ with degree at most five and such that for some constant $c > 0$, $$ \lambda_1(X_n) \geq c(\frac{\log \diam(X_n)}{\diam(X_n)})^2\,, $$ where $\lambda_1$ denotes the smallest…

Probability · Mathematics 2012-05-18 James R. Lee , Teng Qin