English
Related papers

Related papers: An effective estimate for the sum of two cubes pro…

200 papers

We consider spherically symmetric Yang-Mills equations with gauge group $SO(d)$ in $d+1$ dimensional Minkowski spacetime. For any given odd $d\geq 11$, we establish existence and uniqueness (modulo reflection symmetry) of exactly $N$ smooth…

Analysis of PDEs · Mathematics 2026-02-03 Piotr Bizoń , Irfan Glogić , Arthur Wasserman

We show that almost every positive integer can be expressed as a sum of four squares of integers represented as the sums of three positive cubes.

Number Theory · Mathematics 2020-12-17 Javier Pliego

For an arbitrary open, nonempty, bounded set $\Omega \subset \mathbb{R}^n$, $n \in \mathbb{N}$, and sufficiently smooth coefficients $a,b,q$, we consider the closed, strictly positive, higher-order differential operator $A_{\Omega, 2m}…

Analysis of PDEs · Mathematics 2016-05-05 Mark S. Ashbaugh , Fritz Gesztesy , Ari Laptev , Marius Mitrea , Selim Sukhtaiev

By first solving the equation $x^3+y^3+z^3=k$ with fixed $k$ for $z$ and then considering the distance to the nearest integer function of the result, we turn the sum of three cubes problem into an optimisation one. We then apply three…

Number Theory · Mathematics 2023-08-02 Boian Lazov , Tsvetan Vetsov

We prove that every $n$ vertex linear triple system with $m$ edges has at least $m^6/n^7$ copies of a pentagon, provided $m>100 \, n^{3/2}$. This provides the first nontrivial bound for a question posed by Jiang and Yepremyan. More…

Combinatorics · Mathematics 2025-02-18 Dhruv Mubayi , Jozsef Solymosi

Consider the $n$-cube graph with vertices $\{-1,1\}^n$ and edges connecting vertices with hamming distance $1$. How many hyperplanes in $\mathbb{R}^n$ are needed in order to dissect all edges? We show that at least…

Combinatorics · Mathematics 2022-12-23 Ohad Klein

It is conjectured that every integer N>454 is the sum of seven nonnegative cubes. We prove the conjecture when N is a multiple of 4.

Number Theory · Mathematics 2009-03-27 Kent D. Boklan , Noam D. Elkies

We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…

Number Theory · Mathematics 2015-05-13 Damien Roy

Motivated by the counting results for color-critical subgraphs by Mubayi [Adv. Math., 2010], we study the phenomenon behind Mubayi's theorem from a spectral perspective and start up this problem with the fundamental case of triangles. We…

Combinatorics · Mathematics 2023-02-16 Bo Ning , Mingqing Zhai

Let $\sigma(n)$ denote the sum of the positive divisors of $n$. We say that $n$ is perfect if $\sigma(n) = 2 n$. Currently there are no known odd perfect numbers. It is known that if an odd perfect number exists, then it must be of the form…

Number Theory · Mathematics 2007-05-23 Kevin G. Hare

Let $p$ be an odd prime and let $f(x)=\sum_{i=1}^ka_ix^{p^{\alpha_i}+1}\in\Bbb F_{p^n}[x]$, where $0\le \alpha_1<...<\alpha_k$. We consider the exponential sum $S(f,n)=\sum_{x\in\Bbb F_{p^n}}e_n(f(x))$, where $e_n(y)=e^{2\pi…

Number Theory · Mathematics 2007-08-28 Sandra Draper , Xiang-dong Hou

Hardy and Littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. They believed that the number $\mathcal{R}(n)$ of such representations for $n = p+m^2$ is asymptotically given by…

Number Theory · Mathematics 2012-04-10 Aran Nayebi

We establish some upper bounds for the number of integer solutions to the Thue inequality $|F(x , y)| \leq m$, where $F$ is a binary form of degree $n \geq 3$ and with non-zero discriminant $D$, and $m$ is an integer. Our upper bounds are…

Number Theory · Mathematics 2015-08-17 Shabnam Akhtari

We determine all integers $n$ such that $n^2$ has at most three base-$q$ digits for $q \in \{2, 3, 4, 5, 8, 16 \}$. More generally, we show that all solutions to equations of the shape $$ Y^2 = t^2 + M \cdot q^m + N \cdot q^n, $$ where $q$…

Number Theory · Mathematics 2016-11-01 Michael A. Bennett , Adrian-Maria Scheerer

Let $N$ be a fixed positive integer, and let $f\in S_k(N)$ be a primitive cusp form given by the Fourier expansion $f(z)=\sum_{n=1}^{\infty} \lambda_f(n)n^{\frac{k-1}{2}}e(nz)$. We consider the partial sum $S(x,f)=\sum_{n\leq…

Number Theory · Mathematics 2023-08-15 Claire Frechette , Mathilde Gerbelli-Gauthier , Alia Hamieh , Naomi Tanabe

In 1975, P. Erd\H{o}s proposed the problem of determining the maximum number $f(n)$ of edges in a graph with $n$ vertices in which any two cycles are of different lengths. The sequence $(c_1,c_2,\cdots,c_n)$ is the cycle length distribution…

Combinatorics · Mathematics 2020-06-26 Chunhui Lai

In this note, we show that if $N$ is an odd perfect number and $q^{\alpha}$ is some prime power exactly dividing it, then $\sigma(N/q^{\alpha})/q^{\alpha}>5$. In general, we also show that if $\sigma(N/q^{\alpha})/q^{\alpha}<K$, where $K$…

Number Theory · Mathematics 2016-12-08 Jose Arnaldo B. Dris , Florian Luca

Works of Hooley and Heath-Brown imply a near-optimal bound on the number $N$ of integral solutions to $x_1^3+\dots+x_6^3 = 0$ in expanding regions, conditional on automorphy and GRH for certain Hasse--Weil $L$-functions; for regions of…

Number Theory · Mathematics 2023-04-20 Victor Y. Wang

Let f(n,m) be the maximum of the sum of the squares of degrees of a graph with n vertices and m edges. Summarizing earlier research, we present a concise, asymptotically sharp upper bound on f(n,m), better than the bound of de Caen for…

Combinatorics · Mathematics 2007-05-23 Vladimir Nikiforov

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 every sufficiently large even integer $N$, the equation \begin{equation*}…

Number Theory · Mathematics 2018-01-03 Jinjiang Li , Min Zhang
‹ Prev 1 3 4 5 6 7 10 Next ›