English
Related papers

Related papers: A New Lower Bound in the $abc$ Conjecture

200 papers

In this paper, we prove that every prime $p$ which is congruent to $4,7$ modulo $9$ is the sum of two rational cubes. This is $2/3$ of Sylvester's conjecture which has a history of nearly 150 years since 1879. In the proof, we use recent…

Number Theory · Mathematics 2026-05-27 Hongbo Yin

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi

We prove that for each dimension not less than five there exists a contraction between solvable Lie algebras that can be realized only with matrices whose Euclidean norms necessarily approach infinity at the limit value of contraction…

Rings and Algebras · Mathematics 2015-07-06 Dmytro R. Popovych

The $F$-threshold $c^J(\a)$ of an ideal $\a$ with respect to an ideal $J$ is a positive characteristic invariant obtained by comparing the powers of $\a$ with the Frobenius powers of $J$. We study a conjecture formulated in an earlier paper…

Commutative Algebra · Mathematics 2015-01-14 Craig Huneke , Shunsuke Takagi , Kei-ichi Watanabe

We show that a finite zero-sum-free sequence $\alpha$ over an abelian group has at least $c|\alpha|^{4/3}$ distinct subsequence sums, unless $\alpha$ is "controlled" by a small number of its terms; here $|\alpha|$ denotes the number of…

Number Theory · Mathematics 2022-12-21 Vsevolod F. Lev

For any positive integer r, let pi_{2r}(x) denote the number of prime pairs (p, p+2r) with p not exceeding (large) x. According to the prime-pair conjecture of Hardy and Littlewood, pi_{2r}(x) should be asymptotic to 2C_{2r}li_2(x) with an…

Number Theory · Mathematics 2008-06-26 Jacob Korevaar

In 1981, Beck and Fiala [Discrete Appl. Math, 1981] conjectured that given a set system $A \in \{0,1\}^{m \times n}$ with degree at most $k$ (i.e., each column of $A$ has at most $k$ non-zeros), its combinatorial discrepancy…

Combinatorics · Mathematics 2025-08-05 Nikhil Bansal , Haotian Jiang

We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…

Information Theory · Computer Science 2024-05-01 Fernando Hernando , Gary McGuire

Let $c$ be a positive odd integer and $R$ a set of $n$ primes coprime with $c$. We consider equations $X + Y = c^z$ in three integer unknowns $X$, $Y$, $z$, where $z > 0$, $Y > X > 0$, and the primes dividing $XY$ are precisely those in…

Number Theory · Mathematics 2023-01-24 Reese Scott , Robert Styer

Let $\Gamma$ denote the modular group $SL(2,\Bbb Z)$ and $C_n(\Gamma)$ the number of congruence subgroups of $\Gamma$ of index at most $n$. We prove that $\lim\limits_{n\to \infty} \frac{\log C_n(\Gamma)}{(\log n)^2/\log\log n} =…

Group Theory · Mathematics 2007-05-23 D. Goldfeld , A. Lubotzky , L. Pyber

Cilleruelo conjectured that if $f\in\mathbb{Z}[x]$ of degree $d\ge 2$ is irreducible over the rationals, then $\log\operatorname{lcm}(f(1),\ldots,f(N))\sim(d-1)N\log N$ as $N\to\infty$. He proved it for the case $d = 2$. Very recently,…

Number Theory · Mathematics 2019-11-06 Ashwin Sah

Let $d\equiv 2\pmod 4$ be a square-free integer such that $x^2 - dy^2 =- 1$ and $x^2 - dy^2 = 6$ are solvable in integers. We prove the existence of infinitely many quadruples in $\mathbb{Z}[\sqrt{d}]$ with the property $D(n)$ when $n \in…

Number Theory · Mathematics 2022-11-10 Kalyan Chakraborty , Shubham Gupta , Azizul Hoque

Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…

Information Theory · Computer Science 2023-06-16 Jingbo Liu

The problem of finding provably maximal sets of mutually unbiased bases in $\mathbb{C}^d$, for composite dimensions $d$ which are not prime powers, remains completely open. In the first interesting case, $d=6$, Zauner predicted that there…

Quantum Physics · Physics 2021-03-17 Gary McConnell , Harry Spencer , Afaq Tahir

In this short note we confirm the relation between the generalized $abc$-conjecture and the $p$-rationality of number fields. Namely, we prove that given K$/\mathbb{Q}$ a real quadratic extension or an imaginary $S_3$-extension, if the…

Number Theory · Mathematics 2019-07-09 Christian Maire , Marine Rougnant

Recently, Ben Green proved that the two-color van der Waerden number $w(3,k)$ is bounded from below by $k^{b_0(k)}$ where $b_0(k) = c_0\left(\frac{\log k }{\log \log k}\right)^{1/3}$. We prove a new lower bound of $k^{b(k)}$ with $b(k) =…

Combinatorics · Mathematics 2022-08-23 Zach Hunter

Let $A^2(D)$ be the Bergman space over the open unit disk $D$ in the complex plane. Korenblum conjectured that there is an absolute constant $c \in (0,1)$ such that whenever $|f(z)|\le |g(z)|$ in the annulus $c<|z|<1$ then $||f(z)|| \le…

Complex Variables · Mathematics 2015-05-13 Chun-Yen Shen

In this paper, we prove $\text{ex}(n, C_{2k})\le (16\sqrt{5}\sqrt{k\log k} + o(1))\cdot n^{1+1/k}$. We improved on Bukh--Jiang's method used in their 2017 publication, thereby reducing the best known upper bound by a factor of $\sqrt{5\log…

Combinatorics · Mathematics 2020-09-11 Zhiyang He

Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…

Number Theory · Mathematics 2022-01-27 Yong-Gao Chen , Yuchen Ding

We show that if a subset A of {1,...,N} does not contain any solutions to the equation x+y+z=3w with the variables not all equal, then A has size at most exp(-c(log N)^{1/7}) N, where c > 0 is some absolute constant. In view of Behrend's…

Combinatorics · Mathematics 2014-08-13 Tomasz Schoen , Olof Sisask
‹ Prev 1 4 5 6 7 8 10 Next ›