English
Related papers

Related papers: Gain Bounds for Diagonal Superelliptic Equations u…

200 papers

In 2016, Bourgain, Gamburd, and Sarnak proved that Strong Approximation holds for the Markoff surface in most cases. That is, the modulo $p$ solutions to the equation $X_1^2+X_2^2+X_3^2=3X_1X_2X_3$ are covered by the integer solutions for…

Number Theory · Mathematics 2023-11-21 Elisa Bellah , Siran Chen , Elena Fuchs , Lynnelle Ye

We study solutions to the equation $a+b=c$, where $a,b,c$ form a triple of coprime natural numbers. The $abc$ conjecture asserts that, for any $\epsilon>0$, such triples satisfy $\mathrm{rad}(abc) \ge c^{1-\epsilon}$ with finitely many…

Number Theory · Mathematics 2026-05-12 Christian Bernert , Tim Browning , Jared Duker Lichtman , Joni Teräväinen

Let $ \mathbb{Q}\mathcal{E}_{\mathbb{Z}} $ be the set of power sums whose characteristic roots belong to $ \mathbb{Z} $ and whose coefficients belong to $ \mathbb{Q} $, i.e. $ G : \mathbb{N} \rightarrow \mathbb{Q} $ satisfies…

Number Theory · Mathematics 2023-12-05 Clemens Fuchs , Sebastian Heintze

We give full boundary extensions to two fundamental estimates in the theory of elliptic PDE, the weak Harnack inequality and the quantitative strong maximum principle, for uniformly elliptic equations in non-divergence form.

Analysis of PDEs · Mathematics 2017-08-11 Boyan Sirakov

We prove that for sets $A, B, C \subset \mathbb{F}_p$ with $|A|=|B|=|C| \leq \sqrt{p}$ and a fixed $0 \neq d \in \mathbb{F}_p$ holds $$ \max(|AB|, |(A+d)C|) \gg|A|^{1+1/26}. $$ In particular, $$ |A(A+1)| \gg |A|^{1 + 1/26} $$ and $$…

Number Theory · Mathematics 2015-07-21 Dmitrii Zhelezov

Enrico Bombieri showed conditionally (1994) that the ABC conjecture implies Roth's theorem, and Van Frankenhuysen (1999) later provided a complete proof. Building on Bombieri's and Van der Poorten's explicit formula for continued-fraction…

Number Theory · Mathematics 2026-02-06 Karsten Müller , Michael Taktikos

We study the growth of the support size of the capacity-achieving input distribution for the amplitude-constrained additive white Gaussian noise (AWGN) channel. While it is known since Smith (1971) that the optimal input is discrete with…

Information Theory · Computer Science 2025-12-04 Haiyang Wang

We study a semilinear elliptic equation with a pure power nonlinearity with exponent $p>1$, and provide sufficient conditions for the existence of positive solutions. These conditions involve expected exit times from the domain, $D$, where…

Analysis of PDEs · Mathematics 2023-09-26 Ma Elena Hernandez-Hernandez , Pablo Padilla-Longoria

We derive refined entropy upper bounds for $q$-ary $B_2$ codes by exploiting the Fourier structure of the i.i.d. difference distribution $D=X-Y$. Since the pmf of $D$ is an autocorrelation, its Fourier series is a nonnegative trigonometric…

Information Theory · Computer Science 2026-04-01 Stefano Della Fiore

We obtain new bounds for the optimal matching cost for empirical measures with unbounded support. For a large class of radially symmetric and rapidly decaying probability laws, we prove for the first time the asymptotic rate of convergence…

Probability · Mathematics 2024-07-10 Emanuele Caglioti , Michael Goldman , Francesca Pieroni , Dario Trevisan

The aim of this paper is to give an effective version of the Strong Artin Approximation Theorem for binomial equations. First we give an effective version of the Greenberg Approximation Theorem for polynomial equations, then using the…

Commutative Algebra · Mathematics 2013-01-14 Guillaume Rond

We bound the number of electrons $Q$ that an atom can bind in excess of neutrality for density functionals generalizing the classical Thomas-Fermi-Weizs\"acker functional: instead of the classical power $5/3$ more general powers $p$ are…

Mathematical Physics · Physics 2025-02-24 Rafael D. Benguria , Heinz Siedentop

This paper investigates the approximation power of three types of random neural networks: (a) infinite width networks, with weights following an arbitrary distribution; (b) finite width networks obtained by subsampling the preceding…

Machine Learning · Computer Science 2019-10-21 Bolton Bailey , Ziwei Ji , Matus Telgarsky , Ruicheng Xian

Hilberg's conjecture about natural language states that the mutual information between two adjacent long blocks of text grows like a power of the block length. The exponent in this statement can be upper bounded using the pointwise mutual…

Information Theory · Computer Science 2020-03-11 Łukasz Dębowski

We study diophantine equations of the form ${a_1 + \ldots + a_n = 0}$ where the $a_i$'s are assumed to be coprime and to satisfy certain subsum conditions. We are interested in the limit superior of the qualities of the admissible solutions…

Number Theory · Mathematics 2025-07-17 Rupert Hölzl , Sören Kleine , Frank Stephan

For $h \ge 2$ and an infinite set of positive integers $A$, let $R_{A,h}(n)$ denote the number of solutions of the equation $a_{1} + a_{2} + \dots{} + a_{h} = n, a_{1} \in A, \dots{} ,a_{h} \in A, a_{1} < a_{2} < \dots{} < a_{h}.$ In this…

Number Theory · Mathematics 2020-06-05 Sandor Kiss , Csaba Sandor

In this paper we study elliptic equations with a nonlinear conormal derivative boundary condition involving nonstandard growth terms. By means of the localization method and De Giorgi's iteration technique we derive global a priori bounds…

Analysis of PDEs · Mathematics 2015-10-05 Patrick Winkert , Rico Zacher

We describe a new method of proving a priori bounds for positive supersolutions and solutions of superlinear elliptic PDE, based on global weak Harnack inequalities and a quantitative Hopf lemma. Novel results based on the method include:…

Analysis of PDEs · Mathematics 2019-04-16 Boyan Sirakov

We prove that solution of defocusing semilinear wave equation in $\mathbb{R}^{1+3}$ with pure power nonlinearity is uniformly bounded for all $\frac{3}{2}<p\leq 2$ with sufficiently smooth and localized data. The result relies on the…

Analysis of PDEs · Mathematics 2021-04-26 Shiwu Yang

A celebrated important result due to Freedman, Larsen and Wang states that providing additive approximations of the Jones polynomial at the k'th root of unity, for constant k=5 and k>6, is BQP-hard. Together with the algorithmic results of…

Quantum Physics · Physics 2011-03-28 Dorit Aharonov , Itai Arad
‹ Prev 1 2 3 10 Next ›