Related papers: Improved Bound for Tomaszewski's Problem

For positive integers $s$, $t$, $m$ and $n$, the Zarankiewicz number $Z_{s,t}(m,n)$ is defined to be the maximum number of edges in a bipartite graph with parts of sizes $m$ and $n$ that has no complete biparitite subgraph containing $s$…

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

For finite sets A and B in the plane, we write A+B to denote the set of sums of the elements of A and B. In addition, we write tr(A) to denote the common number of triangles in any triangulation of the convex hull of A using the points of A…

The Polignac's Conjecture, first formulated by Alphonse de Polignac in 1849, asserts that, for any even number M, there exist infinitely many couples of prime numbers P, P+M. When M = 2, this reduces to the Twin Primes Conjecture. Despite…

We prove that every odd number $N$ greater than 1 can be expressed as the sum of at most five primes, improving the result of Ramar\'e that every even natural number can be expressed as the sum of at most six primes. We follow the circle…

The Lp-Brunn-Minkowski inequality palys a central role in the Brunn-Minkowski theory proposed by Firey [13] in 60's and developed by Lutwak [26,27] in 90's, which generalizes the classical Brunn-Minkowski inequality by Lp-sum of convex…

In this paper, we provide novel mean value estimates for exponential sums related to the extended main conjecture of Vinogradov's mean value theorem, by developing the Hardy-Littlewood circle method together with a refined shifting…

For any $m \geq 1$, let $H_m$ denote the quantity $H_m := \liminf_{n \to \infty} (p_{n+m}-p_n)$, where $p_n$ denotes the $n^{\operatorname{th}}$ prime; thus for instance the twin prime conjecture is equivalent to the assertion that $H_1$ is…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that, for $0.989<\gamma<1$, there exist infinitely many primes $p$ such that…

A doubly infinite sum, numerically evaluated at between 0.999 and 1.001, turns out to have a nice value.

We establish the first moment bound $$ \sum_{\varphi} L(\varphi \otimes \varphi \otimes \Psi, \tfrac{1}{2}) \ll_{\varepsilon} p^{5/4+\varepsilon} $$ for triple product $L$-functions, where $\Psi$ is a fixed Hecke-Maass form on…

We show that at least 1/3 of positive real numbers are in the set of limit points of normalized prime gaps. More precisely, if $p_n$ denotes the $n$th prime and $\mathbb{L}$ is the set of limit points of the sequence $\{(p_{n+1}-p_n)/\log…

In the present work we demonstrate that the so called Goldbach conjecture from 1742, All positive even numbers greater than two can be expressed as a sum of two primes, due to Leonhard Euler, is a true statement. This result is partially…

We obtain an upper bound for the number of pairs $ (a,b) \in {A\times B} $ such that $ a+b $ is a prime number, where $ A, B \subseteq \{1,...,N \}$ with $|A||B| \, \gg \frac{N^2}{(\log {N})^2}$, $\, N \geq 1$ an integer. This improves on a…

We formulate some refinements of Goldbach's conjectures based on heuristic arguments and numerical data. For instance, any even number greater than 4 is conjectured to be a sum of two primes with one prime being 3 mod 4. In general, for…

Paul Erd\H{o}s and L\'{a}szl\'{o} Lov\'{a}sz proved in a landmark article that, for any positive integer $k$, up to isomorphism there are only finitely many maximal intersecting families of $k-$sets (maximal $k-$cliques). So they posed the…

We measure whether there are numerous pairs of twin primes (hereafter referred to as twin prime pairs) according to the prime number inferred by sieve of Eratosthenes. In this study, we reveal at least three additional twin prime pairs…

In this article, we investigate the conjecture posed by Nadirashvili in 1997. It states that if a harmonic function has bounded nodal volume in the unit ball, then the supermum over the half-ball can be bounded by a finite sum of…

In this paper we settle long-standing questions regarding the combinatorial complexity of Minkowski sums of polytopes: We give a tight upper bound for the number of faces of a Minkowski sum, including a characterization of the case of…

Let I be the toric ideal defined by a 2 x n matrix of integers, A = ((1 1 ... 1)(a_1 a_2 ... a_n)) with a_1<a_2<...<a_n. We give a combinatorial proof that I is generated by elements of degree at most the sum of the two largest differences…