English
Related papers

Related papers: A sharp point-sphere incidence bound for $(u, s)$-…

200 papers

This paper establishes quantitative limit theorems for two classes of Cox point processes, quantifying their convergence to a Poisson point process (PPP). We employ Stein's method for PPP aproximation, leveraging the generator approach and…

Probability · Mathematics 2025-10-07 Hamza Adrat , Laurent Decreusefond

We adapt the approach of Rudnev, Shakan, and Shkredov to prove that in an arbitrary field $\mathbb{F}$, for all $A \subset \mathbb{F}$ finite with $|A| < p^{1/4}$ if $p:= Char(\mathbb{F})$ is positive, we have $$|A(A+1)| \gtrsim |A|^{11/9},…

Combinatorics · Mathematics 2019-08-14 Audie Warren

In dimensions $d \in \{3,4,5,6,7\}$, we prove that the constant functions on the unit sphere $\mathbb{S}^{d-1}\subset \mathbb{R}^d$ maximize the weighted adjoint Fourier restriction inequality $$ \left| \int_{\mathbb{R}^d}…

Classical Analysis and ODEs · Mathematics 2024-10-15 Emanuel Carneiro , Giuseppe Negro , Diogo Oliveira e Silva

A proof for the lower bound is provided for the smallest eigenvalue of finite element equations with arbitrary conforming simplicial meshes. The bound has a similar form as the one by Graham and McLean [SIAM J. Numer. Anal., 44 (2006), pp.…

Numerical Analysis · Mathematics 2021-06-24 Lennard Kamenski

This paper provides new bounds on the size of spheres in any coordinate-additive metric with a particular focus on improving existing bounds in the sum-rank metric. We derive improved upper and lower bounds based on the entropy of a…

Information Theory · Computer Science 2025-07-04 Hugo Beeloo-Sauerbier Couvée , Thomas Jerkovits , Jessica Bariffi

We define three-point bounds for sphere packing that refine the linear programming bound, and we compute these bounds numerically using semidefinite programming by choosing a truncation radius for the three-point function. As a result, we…

Metric Geometry · Mathematics 2022-07-01 Henry Cohn , David de Laat , Andrew Salmon

We present in this paper algorithms for solving stiff PDEs on the unit sphere with spectral accuracy in space and fourth-order accuracy in time. These are based on a variant of the double Fourier sphere method in coefficient space with…

Numerical Analysis · Mathematics 2017-12-27 Hadrien Montanelli , Yuji Nakatsukasa

For an $n$-variate order-$d$ tensor $A$, define $ A_{\max} := \sup_{\| x \|_2 = 1} \langle A , x^{\otimes d} \rangle$ to be the maximum value taken by the tensor on the unit sphere. It is known that for a random tensor with i.i.d $\pm 1$…

Computational Complexity · Computer Science 2017-06-20 Vijay Bhattiprolu , Venkatesan Guruswami , Euiwoong Lee

Let $K$ be a centrally symmetric spherical and simplicial polytope, whose vertices form a $\frac{1}{4n}-$net in the unit sphere in $\mathbb{R}^n$. We prove a uniform lower bound on the norms of all hyperplane projections $P: X \to X$, where…

Functional Analysis · Mathematics 2022-11-10 Tomasz Kobos

In this article, we analyze semi-discrete finite element approximation and full discretization of a fourth-order stochastic pseudo-parabolic equation in a bounded convex polygonal domain driven by additive Wiener noise. We use the finite…

Numerical Analysis · Mathematics 2026-03-11 Suprio Bhar , Mrinmay Biswas , Mangala Prasad

Employing numerical and theoretical methods, we investigate the structural characteristics of random sequential addition (RSA) of congruent spheres in $d$-dimensional Euclidean space $\mathbb{R}^d$ in the infinite-time or saturation limit…

Statistical Mechanics · Physics 2015-06-25 S. Torquato , O. U. Uche , F. H. Stillinger

We improve a bound due to the second author on number of rational points on smooth surfaces in $\mathbb{P}^3$ over finite fields and look at families of surfaces that achieve or nearly achieve this bound, for which we compute their exact…

Number Theory · Mathematics 2026-05-12 Yves Aubry , José Felipe Voloch

We introduce a new method for building higher-degree sum-of-squares lower bounds over the hypercube $\mathbf{x} \in \{\pm 1\}^N$ from a given degree 2 lower bound. Our method constructs pseudoexpectations that are positive semidefinite by…

Data Structures and Algorithms · Computer Science 2020-09-16 Dmitriy Kunisky

One-dimensional chains of non-Abelian quasiparticles described by $SU(2)_k$ Chern-Simons-Witten theory can enter random singlet phases analogous to that of a random chain of ordinary spin-1/2 particles (corresponding to $k \to \infty$). For…

Mesoscale and Nanoscale Physics · Physics 2011-11-09 N. E. Bonesteel , Kun Yang

The theory of mixed finite element methods for solving different types of elliptic partial differential equations in saddle point formulation is well established since many decades. This topic was mostly studied for variational formulations…

Numerical Analysis · Mathematics 2024-03-04 Vitoriano Ruas

This letter aims at resolving the issues raised in the recent short communication [1] and answered by [2] by proposing a systematic approximation scheme based on non-mapped shape functions, which both allows to fully exploit the unique…

Numerical Analysis · Computer Science 2011-07-20 Stephane PA Bordas , Sundararajan Natarajan

We use the $4-\epsilon$ expansion to search for fixed points corresponding to $2+1$ dimensional $\mathcal{N}$=1 Wess-Zumino models of $N_{\Phi}$ scalar superfields interacting through a cubic superpotential. In the $N_{\Phi}=3$ case, we…

High Energy Physics - Theory · Physics 2021-12-22 Pedro Liendo , Junchen Rong

We give a lower bound for the size of a subset of $\mathbb F_q^n$ containing a rich k-plane in every direction, a k-plane Furstenberg set. The chief novelty of our method is that we use arguments on non-reduced subschemes and flat families…

Algebraic Geometry · Mathematics 2016-10-05 Jordan S. Ellenberg , Daniel Erman

We study algorithmic applications of a natural discretization for the hard-sphere model and the Widom-Rowlinson model in a region $\mathbb{V}\subset\mathbb{R}^d$. These models are used in statistical physics to describe mixtures of one or…

Data Structures and Algorithms · Computer Science 2022-02-17 Tobias Friedrich , Andreas Göbel , Maximilian Katzmann , Martin S. Krejca , Marcus Pappik

The Sum-of-Squares (SoS) hierarchy of semidefinite programs is a powerful algorithmic paradigm which captures state-of-the-art algorithmic guarantees for a wide array of problems. In the average case setting, SoS lower bounds provide strong…

Computational Complexity · Computer Science 2021-11-18 Chris Jones , Aaron Potechin , Goutham Rajendran , Madhur Tulsiani , Jeff Xu
‹ Prev 1 4 5 6 7 8 10 Next ›