Related papers: On Vu's restricted box estimate in Waring's proble…

Let $k \geq 2$ and $b \geq 3$ be integers, and suppose that $d_1, d_2 \in \{0,1,\dots, b - 1\}$ are distinct and coprime. Let $\mathcal{S}$ be the set of non-negative integers, all of whose digits in base $b$ are either $d_1$ or $d_2$. Then…

Let $\mathcal{R}_k(n)$ be the number of representations of an integer $n$ as the sum of a prime and a $k$-th power. Define E_k(X) := |\{n \le X, n \in I_k, n\text{not a sum of a prime and a $k$-th power}\}|. Hardy and Littlewood conjectured…

We propose a new algorithm for computing validated bounds for the solutions to the first order variational equations associated to ODEs. These validated solutions are the kernel of numerics computer-assisted proofs in dynamical systems…

We continue our study of the Widom factors for $L_p(\mu)$ extremal polynomials initiated in [4]. In this work we characterize sets for which the lower bounds obtained in [4] are saturated, establish continuity of the Widom factors with…

Let $I_{s,k,r}(X)$ denote the number of integral solutions of the modified Vinogradov system of equations $$x_1^j+\ldots +x_s^j=y_1^j+\ldots +y_s^j\quad (\text{$1\le j\le k$, $j\ne r$}),$$ with $1\le x_i,y_i\le X$ $(1\le i\le s)$. By…

We show that if $(X, \mu, T)$ is a probability measure-preserving dynamical system, and $\mathscr{P}$ is a countable partition of $(X, \mu)$, then the limit $$ \lim_{n, k \to \infty} \mathbb{E} \left[ \frac{1}{k} \sum_{j = 0}^{k - 1} f…

This paper defines multidimensional sequential optimization numbers and prove that the unsigned Stirling numbers of first kind are 1-dimensional sequential optimization numbers. This paper gives a recurrence formula and an upper bound of…

We study the time complexity of the discrete $k$-center problem and related (exact) geometric set cover problems when $k$ or the size of the cover is small. We obtain a plethora of new results: - We give the first subquadratic algorithm for…

We consider intersections of n diagonal forms of degrees k 1 < $\bullet$ $\bullet$ $\bullet$ < kn, and we prove an asymptotic formula for the number of rational points of bounded height on these varieties. The proof uses the…

We show that for a fixed $q$, the number of $q$-ary $t$-error correcting codes of length $n$ is at most $2^{(1 + o(1)) H_q(n,t)}$ for all $t \leq (1 - q^{-1})n - C_q\sqrt{n \log n}$ (for sufficiently large constant $C_q$), where $H_q(n, t)…

We determine the large-time behavior of unbounded solutions for the so-called viscous Hamilton Jacobi equation, $u_t - \Delta u + |Du|^m = f(x)$, in the quadratic and subquadratic cases (i.e., for $1<m\leq 2$), with a particular focus on…

We give improved lower bounds for the number of solutions of some $S$-unit equations over the integers, by counting the solutions of some associated linear equations as the coefficients in those equations vary over sparse sets. This method…

In this paper we study a class of critical Choquard equations with a symmetric potential, i.e. we consider the equation $$-\Delta u +V(|x|) u =\left(|x|^{-\mu}* |u|^{2^\star_\mu}\right)|u|^{2^\star_\mu-2}u,\quad\mbox{in}\quad\mathbb R^N$$…

We show quantum lower bounds for two problems. First, we consider the problem of determining if a sequence of parentheses is a properly balanced one (a Dyck word), with a depth of at most $k$. It has been known that, for any $k$,…

Let $k\geq2$ and $s$ be positive integers. Let $\theta\in(0,1)$ be a real number. In this paper, we establish that if $s>k(k+1)$ and $\theta>0.55$, then every sufficiently large natural number $n$, subjects to certain congruence conditions,…

A famous conjecture of Littlewood (c. 1930) concerns approximating two real numbers by rationals of the same denominator, multiplying the errors. In a lesser-known paper, Wang and Yu (1981) established an asymptotic formula for the number…

When $s\ge k\ge 3$ and $n_1,\ldots ,n_k$ are large natural numbers, denote by $A_{s,k}(\mathbf n)$ the number of solutions in non-negative integers $\mathbf x$ to the system \[ x_1^j+\ldots +x_s^j=n_j\quad (1\le j\le k). \] Under…

We adapt an argument of Tao and Vu to show that if $\lambda_1\le\cdots\le\lambda_d$ are the successive minima of an origin-symmetric convex body $K$ with respect to some lattice $\Lambda<\mathbb{R}^d$, and if we set…

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

We propose an exact method which combines the resolution search and branch & bound algorithms for solving the 0?1 Multidimensional Knapsack Problem. This algorithm is able to prove large?scale strong correlated instances. The optimal values…