Related papers: Representing integers as a sum of three cubes

We establish that, for almost all natural numbers $N$, there is a sum of two positive integral cubes lying in the interval $[N-N^{7/18+\epsilon},N]$. Here, the exponent $7/18$ lies half way between the trivial exponent $4/9$ stemming from…

We present a survey of recent results, scattered in a series of papers that appeared during past five years, whose common denominator is the use of cubic relations in various algebraic structures. Cubic (or ternary) relations can represent…

Let $\mu_1, \ldots, \mu_s$ be real numbers, with $\mu_1$ irrational. We investigate sums of shifted cubes $F(x_1,\ldots,x_s) = (x_1 - \mu_1)^3 + \ldots + (x_s - \mu_s)^3$. We show that if $\eta$ is real, $\tau >0$ is sufficiently large, and…

We give a bijective parameter representation for a sum of squares of numbers being equal to another sum of squares of numbers.

In the last three decades, the $k$-SUM hypothesis has emerged as a satisfying explanation of long-standing time barriers for a variety of algorithmic problems. Yet to this day, the literature knows of only few proven consequences of a…

We give an algorithm that produces all solutions of the equation $\sum_{i=1}^n 1/x_i = 1$ in integers of the form $2^a k^b$, where $k$ is a fixed positive integer that is not a power of $2$, $a$ is an element of $\{0,1,2\}$ that can vary…

We present new combinatorial proofs of Nicomachus's Theorem for the sum of the third powers of the first n natural numbers. The key step is that we define a 4-dimensional block which comprises unit hyper-cubes. In our first proof we…

Let $r_3(n)$ be the number of representations of a positive integer $n$ as a sum of three squares of integers. We give two distinct proofs of a conjecture of Wagon concerning the asymptotic value of the mean square of $r_3(n)$.

We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…

We investigate here sums of triangular numbers $f(x):=\sum_i b_i T_{x_i}$ where $T_n$ is the $n$-th triangular number. We show that for a set of positive integers $S$ there is a finite subset $S_0$ such that $f$ represents $S$ if and only…

Recently, Jha (arXiv:2007.04243, arXiv:2011.11038) has found identities that connect certain sums over the divisors of $n$ to the number of representations of $n$ as a sum of squares and triangular numbers. In this note, we state a…

We produce congruences modulo a prime $p>3$ for sums $\sum_k\binom{3k}{k}x^k$ over ranges $0\le k<q$ and $0\le k<q/3$, where $q$ is a power of $p$. Here $x$ equals either $c^2/(1-c)^3$, or $4s^2/\bigl(27(s^2-1)\bigr)$, where $c$ and $s$ are…

We investigate the existence of representations of every large positive integer as a sum of $k$-th powers of integers represented as certain diagonal forms. In particular, we consider a family of diagonal forms and discuss the problem of…

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…

Let $k\ge 1$ be an integer. We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{k}+p_{2}^{2}+p_{3}^{2}$, where $p_1,p_2,p_3$ are prime numbers, holds in intervals shorter than the ones…

Let s(n) be the number of representations of n as the sum of three squares. We prove a remarkable new identity for s(p^2n)- ps(n) with p being an odd prime. This identity makes nontrivial use of ternary quadratic forms with discriminants…

We give an asymptotic formula for the mean value of the number of representations of an integer as sum of two squares known as the Gauss circle problem.

We present a complete proof synthesis method for the eight type systems of Barendregt's cube extended with $\eta$-conversion. Because these systems verify the proofs-as-objects paradigm, the proof synthesis method is a one level process…

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

We propose a sum rule for derangements. Three different proofs are provided. The first one involves integral representations and the second one relies on the Hermite identity for the integer part of the product of an integer by a real…