English
Related papers

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

200 papers

We construct unbounded positive $C^2$-solutions of the equation $\Delta u + K u^{(n + 2)/(n - 2)} = 0$ in ${\R}^n$ (equipped with Euclidean metric $g_o$) such that $K$ is bounded between two positive numbers in ${\R}^n$, the conformal…

Analysis of PDEs · Mathematics 2007-05-23 Man Chun Leung

As a first result we prove higher order Schauder estimates for solutions to singular/degenerate elliptic equations of type: \[ -\mathrm{div}\left(\rho^aA\nabla w\right)=\rho^af+\mathrm{div}\left(\rho^aF\right) \quad\textrm{in}\; \Omega \]…

Analysis of PDEs · Mathematics 2024-04-04 Susanna Terracini , Giorgio Tortone , Stefano Vita

We provide an upper bound on the efficient irrationality exponents of cubic algebraics $x$ with the minimal polynomial $x^3 - tx^2 - a$. In particular, we show that it becomes non-trivial, i.e. better than the classical bound of Liouville…

Number Theory · Mathematics 2023-01-09 Dzmitry Badziahin

The classical Erd\H{o}s-Littlewood-Offord problem concerns the random variable $X = a_1 \xi_1 + \dots + a_n \xi_n$, where $a_i \in \mathbb{R} \setminus \{0\}$ are fixed and $\xi_i \sim \text{Ber}(1/2)$ are independent. The…

Combinatorics · Mathematics 2020-01-03 Mihir Singhal

Let $f(n, v, e)$ denote the maximum number of edges in a 3-uniform hypergraph on $n$ vertices which does not contain $v$ vertices spanning at least $e$ edges. A central problem in extremal combinatorics, famously posed by Brown, Erd\H{o}s…

Combinatorics · Mathematics 2025-07-10 Oliver Janzer , Abhishek Methuku , Aleksa Milojević , Benny Sudakov

We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper…

Optimization and Control · Mathematics 2016-05-26 Etienne de Klerk , Jean Lasserre , Monique Laurent , Zhao Sun

The system of equations \[ u_1p_1^2 + \ldots + u_sp_s^2 = 0 \] \[ v_1p_1^3 + \ldots + v_sp_s^3 = 0 \] has prime solutions $(p_1, \ldots, p_s)$ for $s \geq 12$, assuming that the system has solutions modulo each prime $p$. This is proved via…

Number Theory · Mathematics 2020-09-22 Alan Talmage

We consider the problem \begin{equation}\label{Eq:Abstract} (1)\;\;\;\begin{cases} S_k(D^2u)= \lambda (1-u)^q &\mbox{in }\;\; B,\\ u <0 & \mbox{in }\;\; B,\\ u=0 &\mbox{on }\partial B, \end{cases} \end{equation} where $B$ denotes the unit…

Analysis of PDEs · Mathematics 2015-10-28 Justino Sánchez , Vicente Vergara

In adaptive importance sampling, and other contexts, we have $K>1$ unbiased and uncorrelated estimates $\hat\mu_k$ of a common quantity $\mu$. The optimal unbiased linear combination weights them inversely to their variances but those…

Statistics Theory · Mathematics 2019-04-01 Art B. Owen , Yi Zhou

We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-of-Squares method (Lasserre hierarchy). Our approach is based on using the connection between these relaxations and the Sum-of-Squares proof…

Data Structures and Algorithms · Computer Science 2013-12-24 Boaz Barak , Jonathan Kelner , David Steurer

Let $P$ be a polynomial with integer coefficients and degree at least two. We prove an upper bound on the number of integer solutions $n\leq N$ to $n! = P(x)$ which yields a power saving over the trivial bound. In particular, this applies…

Number Theory · Mathematics 2022-04-19 Hung M. Bui , Kyle Pratt , Alexandru Zaharescu

For a set of n points in the plane, we consider the axis--aligned (p,k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain n-k points. In this paper, we consider the boxes to be either squares or…

Computational Geometry · Computer Science 2010-07-28 Hee-Kap Ahn , Sang Won Bae , Erik D. Demaine , Martin L. Demaine , Sang-Sub Kim , Matias Korman , Iris Reinbacher , Wanbin Son

Let $k$ and $n$ be positive integers. Define $R(n,k)$ to be the minimum positive value of $$ | e_i \sqrt{s_1} + e_2 \sqrt{s_2} + ... + e_k \sqrt{s_k} -t | $$ where $ s_1, s_2, ..., s_k$ are positive integers no larger than $n$, $t$ is an…

Computational Geometry · Computer Science 2015-05-13 Qi Cheng , Xianmeng Meng , Celi Sun , Jiazhe Chen

We study sharp weighted Sobolev-type inequalities of the form \[ \int_{0}^{1}|u(x)|\rho(x) \diff x \leqslant \Lambda \Bigl(\int_{0}^{1}|u^{(k)}(x)|^2 \diff x\Bigr)^{1/2}, \qquad u\in H_0^k(0,1), \] where $\rho$ is a non-negative weight. We…

Analysis of PDEs · Mathematics 2026-05-26 Raul Hindov , Evgeniy Lokharu

The best known upper estimates for the constants of the Hardy--Littlewood inequality for $m$-linear forms on $\ell_{p}$ spaces are of the form $\left(\sqrt{2}\right) ^{m-1}.$ We present better estimates which depend on $p$ and $m$. An…

Functional Analysis · Mathematics 2015-10-08 Gustavo Araujo , Daniel Pellegrino , Diogo D. P. Silva e Silva

In this work, we focus on separable convex optimization problems with linear and box constraints and compute the solution in closed-form as a function of some Lagrange multipliers that can be easily computed in a finite number of…

Information Theory · Computer Science 2014-03-25 Antonio A. D'Amico , Luca Sanguinetti , Daniel P. Palomar

By some extremely simple arguments, we point out the following: (i) If n is the least positive k-th power non-residue modulo a positive integer m, then the greatest number of consecutive k-th power residues mod m is smaller than m/n. (ii)…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

We analyze the instantaneous growth of analyticity radius for three dimensional generalized Navier-Stokes equations. For the subcritical $H^{\gamma}(\mathbb R^3)$ case with $\gamma>\frac12,$ we prove that there exists a positive time $t_0$…

Analysis of PDEs · Mathematics 2025-06-06 Dong Li , Ping Zhang

In this paper, we study a density version of Waring's problem. We prove that a positive density subset of $k$th-powers forms an asymptotic additive basis of order $O(k^2)$ provided that the relative lower density of the set is greater than…

Number Theory · Mathematics 2022-03-08 Juho Salmensuu

Let $f^{(r)}(n;s,k)$ be the maximum number of edges in an $n$-vertex $r$-uniform hypergraph containing no $k$ edges on at most $s$ vertices. Brown, Erd\H{o}s and S\'os conjectured in 1973 that the limit $\lim_{n\rightarrow…

Combinatorics · Mathematics 2025-10-17 Oleg Pikhurko , Shumin Sun
‹ Prev 1 3 4 5 6 7 10 Next ›