English
Related papers

Related papers: New Restriction Estimates for the 3-d Paraboloid o…

200 papers

In this paper, we present a different proof on the discrete Fourier restriction. The proof recovers Bourgain's level set result on Strichartz estimates associated with Schr\"odinger equations on torus. Some sharp estimates on…

Classical Analysis and ODEs · Mathematics 2011-08-26 Yi Hu , Xiaochun Li

We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.

Combinatorics · Mathematics 2025-10-06 Ritesh Goenka , Kenneth Moore , Ethan Patrick White

We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…

Number Theory · Mathematics 2013-08-23 Omran Ahmadi , Igor E. Shparlinski

The purpose of this article is to establish new lower bounds for the sums of powers of eigenvalues of the Dirichlet fractional Laplacian operator $(-\Delta)^{\alpha/2}|_{\Omega}$ restricted to a bounded domain $\Omega\subset{\mathbb R}^d$…

Analysis of PDEs · Mathematics 2015-01-08 Turkay Yolcu , Selma Yildirim Yolcu

In Fourier restriction problems, a cone and a paraboloid are model surfaces. The sharp bilinear cone restriction estimate was first shown by Wolff, and later the endpoint was obtained by Tao. For a paraboloid, the sharp $L^2$ bilinear…

Classical Analysis and ODEs · Mathematics 2021-12-23 Jungjin Lee

We propose the implementation of two ingredients in the phenomenological applications of the unitary approach based on the $z$-expansion of hadronic form factors, commonly referred to as the Boyd-Grinstein-Lebed (BGL) $z$-expansion [1-4].…

High Energy Physics - Phenomenology · Physics 2026-03-25 Silvano Simula , Ludovico Vittorio

The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…

Number Theory · Mathematics 2007-05-23 Ben Green

We study an expansion method for high-dimensional parabolic PDEs which constructs accurate approximate solutions by decomposition into solutions to lower-dimensional PDEs, and which is particularly effective if there are a low number of…

Analysis of PDEs · Mathematics 2016-11-08 Christoph Reisinger , Rasmus Wissmann

The purpose of this paper is to prove a Fourier restriction estimate for certain 2-dimensional surfaces in $\bbR^{2d}$, $d\ge 3$. These surfaces are defined by a complex curve $\gamma(z)$ of simple type, which is given by a mapping of the…

Classical Analysis and ODEs · Mathematics 2013-04-01 Jong-Guk Bak , Seheon Ham

We prove limit theorems and variance estimates for quantities related to ponds and outlets for 2D invasion percolation. We first exhibit several properties of a sequence $({\mathbf{O}}(n))$ of outlet variables, the $n$th of which gives the…

Probability · Mathematics 2014-07-04 Michael Damron , Artëm Sapozhnikov

In this paper we prove some results on sum-product estimates over arbitrary finite fields. More precisely, we show that for sufficiently small sets $A\subset \mathbb{F}_q$ we have \[|(A-A)^2+(A-A)^2|\gg |A|^{1+\frac{1}{21}}.\] This can be…

Number Theory · Mathematics 2018-07-17 Doowon Koh , Sujin Lee , Thang Pham , Chun-Yen Shen

We estimate, in a number field, the number of elements and the maximal number of linearly independent elements, with prescribed bounds on their valuations. As a by-product, we obtain new bounds for the successive minima of ideal lattices.…

Number Theory · Mathematics 2024-11-18 Mikołaj Frączyk , Gergely Harcos , Péter Maga

The paper has two purposes. First, we start to develop a theory of infinite global fields, i.e., of infinite algebraic extensions either of ${\mathbb{Q}}$ or of ${\mathbb{F}}_r(t)$. We produce a series of invariants of such fields, and we…

Number Theory · Mathematics 2007-05-23 Michael Tsfasman , Serge Vladut

We survey recent (and not so recent) results concerning arrangements of lines, points and other geometric objects and the applications these results have in theoretical computer science and combinatorics. The three main types of problems we…

Combinatorics · Mathematics 2015-03-20 Zeev Dvir

We say that $d_3(n)$ has exponent of distribution $\theta$ if, for every $\varepsilon>0$, the expected asymptotic holds uniformly for all moduli $q \le x^{\theta-\varepsilon}$. Nguyen proved, following earlier work of Banks, Heath-Brown,…

Number Theory · Mathematics 2026-04-23 Metin Can Aydemir , Muhammet Boran

A new class of high-order maximum principle preserving numerical methods is proposed for solving parabolic equations, with application to the semilinear Allen--Cahn equation. The proposed method consists of a $k$th-order multistep…

Numerical Analysis · Mathematics 2020-10-20 Buyang Li , Jiang Yang , Zhi Zhou

Fourth-order differential equations play an important role in many applications in science and engineering. In this paper, we present a three-field mixed finite-element formulation for fourth-order problems, with a focus on the effective…

Numerical Analysis · Mathematics 2022-10-13 Patrick E. Farrell , Abdalaziz Hamdan , Scott P. MacLachlan

In this paper we present a generalization in the context of multilinear Muckenhoupt classes of the endpoint extrapolation theorem on restricted weights due to Carro, Grafakos and Soria. Moreover, our main result is obtained on limited…

Classical Analysis and ODEs · Mathematics 2024-06-25 Kangwei Li , Teresa Luque , Sheldy Ombrosi

We present an elementary approach to prove restriction theorems for particular surfaces for which the Tomas-Stein theorem does not apply, which in turn provide short proofs for well-known Strichartz estimates for associated PDEs. The method…

Analysis of PDEs · Mathematics 2021-11-30 Corentin Gentil , Côme Tabary

A major open problem in proof complexity is to demonstrate that random 3-CNFs with a linear number of clauses require super-polynomial size refutations in bounded-depth Frege systems. We take the first step towards addressing this question…

Computational Complexity · Computer Science 2024-09-04 Svyatoslav Gryaznov , Navid Talebanfard