English
Related papers

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

200 papers

In this paper, we are concerned with the upper box-counting dimension of the set of possible singular points in space-time of suitable weak solutions to the 3D Navier-Stokes equations. By taking full advantage of the pressure $\Pi$ in terms…

Analysis of PDEs · Mathematics 2017-04-05 Yanqing Wang , Gang Wu

For the numerical solution of the cubic nonlinear Schr\"{o}dinger equation with periodic boundary conditions, a pseudospectral method in space combined with a filtered Lie splitting scheme in time is considered. This scheme is shown to…

Numerical Analysis · Mathematics 2025-11-18 Lun Ji , Alexander Ostermann , Frédéric Rousset , Katharina Schratz

Consider a sum $S_n=v_i\varepsilon_1+\cdots+v_n\varepsilon_{n}$, where $(v_i)^{n}_{i=1}$ are non-zero vectors in $\mathbb{R}^{d}$ and $(\varepsilon_i)^{n}_{i=1}$ are independent Rademacher random variables (i.e.,…

Probability · Mathematics 2019-10-23 Dainius Dzindzalieta , Tomas Juškevičius

For each positive integer $n$, let $g_{\mathbb Z}(n)$ be the smallest integer such that if an integral quadratic form in $n$ variables can be written as a sum of squares of integral linear forms, then it can be written as a sum of…

Number Theory · Mathematics 2017-03-01 Constantin N. Beli , Wai Kiu Chan , Maria Ines Icaza , Jingbo Liu

The celebrated Littlewood-Offord problem asks for an upper bound on the probability that the random variable $\epsilon_1 v_1 + \cdots + \epsilon_n v_n$ lies in the Euclidean unit ball, where $\epsilon_1, \ldots, \epsilon_n \in \{-1, 1\}$…

Combinatorics · Mathematics 2019-05-01 Shravas Rao

One of the first parametrised Thue equations, $$\left| X^3 - (n-1)X^2 Y - (n+2) XY^2 - Y^3 \right| = 1,$$ over the integers was solved by E. Thomas in 1990. If we interpret this as a norm-form equation, we can write this as $$\left|…

Number Theory · Mathematics 2023-06-21 Tobias Hilgart , Volker Ziegler

In this article, we improve the convergence order of some finite volume solutions approximating some second order elliptic problems. We prove that finite volume approximations of order $O(h^{k+1})$, with $k$ integer, can be obtained after…

Numerical Analysis · Mathematics 2007-05-23 Bilal Atfeh , Abdallah Bradji

We apply the efficient congruencing method to estimate Vinogradov's integral for moments of order 2s, with 1<=s<=k^2-1. Thereby, we show that quasi-diagonal behaviour holds when s=o(k^2), we obtain near-optimal estimates for…

Number Theory · Mathematics 2019-12-19 Trevor D. Wooley

We prove near-optimal upper bounds for the odd moments of the distribution of coprime residues in short intervals, confirming a conjecture of Montgomery and Vaughan. As an application we prove near-optimal upper bounds for the average of…

Number Theory · Mathematics 2026-05-13 Thomas F. Bloom , Vivian Kuperberg

Let $k$ and $n$ be positive integers, $n>k$. Define $r(n,k)$ to be the minimum positive value of $$ |\sqrt{a_1} + ... + \sqrt{a_k} - \sqrt{b_1} - >... -\sqrt{b_k} | $$ where $ a_1, a_2, ..., a_k, b_1, b_2, ..., b_k $ are positive integers…

Computational Geometry · Computer Science 2007-05-23 Qi Cheng

We prove a number of \textit{a priori} estimates for weak solutions of elliptic equations or systems with vertically independent coefficients in the upper-half space. These estimates are designed towards applications to boundary value…

Classical Analysis and ODEs · Mathematics 2014-06-26 Pascal Auscher , Sebastian Stahlhut

We consider a system of $R$ cubic forms in $n$ variables, with integer coefficients, which define a smooth complete intersection in projective space. Provided $n\geq 25R$, we prove an asymptotic formula for the number of integer points in…

Number Theory · Mathematics 2022-06-22 Simon L. Rydin Myerson

Consider nonzero vectors $a_{1},\dots,a_{n}\in\mathbb{C}^{k}$, independent Rademacher random variables $\xi_{1},\dots,\xi_{n}$, and a set $S\subseteq\mathbb{C}^{k}$. What upper bounds can we prove on the probability that the random sum…

Combinatorics · Mathematics 2025-06-02 Alexandr Grebennikov , Matthew Kwan

We consider random systems of equations x_1 + ... + x_k = a; 0 <= a <= 2 which are interpreted as equations modulo 3: We show for k >= 15 that the satisfiability threshold of such systems occurs where the 2-core has density 1: We show a…

Discrete Mathematics · Computer Science 2011-12-12 Andreas Goerdt , Lutz Falke

Given $m \in \mathbb{N} \setminus \{0\}$ and $\rho > 0$, we find solutions $(\lambda,u)$ to the problem \begin{equation*} \begin{cases} \bigl(-\frac{\mathrm{d}^2}{\mathrm{d} x^2}\bigr)^m u + \lambda G'(u) = F'(u)\\ \int_{\mathbb{R}} K(u) \,…

Classical Analysis and ODEs · Mathematics 2025-12-08 Jacopo Schino , Panayotis Smyrnelis

In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of arithmetic functions, we give an explicit formula for the number of solutions of the linear congruence $a_1x_1+\cdots +a_kx_k\equiv b \pmod{n}$, with…

Number Theory · Mathematics 2016-09-14 Khodakhast Bibak , Bruce M. Kapron , Venkatesh Srinivasan , Roberto Tauraso , László Tóth

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

Combinatorics · Mathematics 2023-09-15 Michelle Delcourt , Luke Postle

The paper deals with the equation $-\Delta u+a(x) u =|u|^{p-1}u $, $u \in H^1(\mathbb{R}^N)$, with $N\ge 2$, $p>1,\ p<{N+2\over N-2}$ if $N\ge 3$, $a\in L^{N/2}_{loc}(\mathbb{R}^N)$, $\inf a>0$, $\lim_{|x| \to \infty} a(x)= a_\infty$.…

Analysis of PDEs · Mathematics 2021-04-15 Riccardo Molle , Donato Passaseo

We prove a Wiener energy estimate for relaxed Dirichlet problems $Lu + \mu u =\nu$ in $\Omega$, with $L$ an uniformly elliptic operator with bounded coefficients, $\mu$ a measure of ${\cal M}_0(\Omega)$, $\nu$ a Kato measure and $\Omega$ a…

funct-an · Mathematics 2008-02-03 Adriana Garroni

We study the weighted $k$-Set Packing problem: Given a collection $S$ of sets, each of cardinality at most $k$, together with a positive weight function $w:\mathcal{S}\rightarrow\mathbb{Q}_{>0}$, the task is to compute a disjoint…

Data Structures and Algorithms · Computer Science 2022-08-19 Meike Neuwohner