English
Related papers

Related papers: Universal Barrier is $n$-Self-Concordant

200 papers

A Chebyshev-type quadrature for a probability measure sigma is a distribution which is uniform on n points and has the same first k moments as sigma. We give an upper bound for the minimal n required to achieve a given degree k, for sigma…

Classical Analysis and ODEs · Mathematics 2017-03-14 Ron Peled

We establish in this paper an upper bound on the second eigenvalue of n-dimensional spheres in the conformal class of the round sphere. This upper bound holds in all dimensions and is asymptotically sharp as the dimension increases.

Spectral Theory · Mathematics 2012-06-04 Romain Petrides

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

Combinatorics · Mathematics 2023-10-24 Herbert Edelsbrunner , János Pach

We say that collection of $n$-qudit gates is universal if there exists $N_0\geq n$ such that for every $N\geq N_0$ every $N$-qudit unitary operation can be approximated with arbitrary precision by a circuit built from gates of the…

Quantum Physics · Physics 2007-05-23 Gabor Ivanyos

We show that if $\Omega \subset \mathbb{R}^{n+1}$, $n\geq 1$, is a uniform domain (aka 1-sided NTA domain), i.e., a domain which enjoys interior Corkscrew and Harnack Chain conditions, then uniform rectifiability of the boundary of $\Omega$…

Classical Analysis and ODEs · Mathematics 2018-10-10 Jonas Azzam , Steve Hofmann , José María Martell , Kaj Nyström , Tatiana Toro

The Heilbronn triangle problem asks for the placement of $n$ points in a unit square that maximizes the smallest area of a triangle formed by any three of those points. In $1972$, Schmidt considered a natural generalization of this problem.…

Discrete Mathematics · Computer Science 2024-05-22 Rishikesh Gajjala , Jayanth Ravi

Lebesgue's universal covering problem is re-examined using computational methods. This leads to conjectures about the nature of the solution which if correct could provide a blueprint for a complete solution. Empirical lower bounds for the…

Metric Geometry · Mathematics 2014-02-20 Philip Gibbs

For every given $\beta<0$, we study the problem of maximizing the first Robin eigenvalue of the Laplacian $\lambda_\beta(\Omega)$ among convex (not necessarily smooth) sets $\Omega\subset\mathbb{S}^{n}$ with fixed perimeter. In particular,…

Analysis of PDEs · Mathematics 2025-07-30 Paolo Acampora , Antonio Celentano , Emanuele Cristoforoni , Carlo Nitsch , Cristina Trombetti

We give a short proof of local well-posedness for the initial boundary value problem in general relativity with sole boundary condition the requirement that the boundary is umbilic. This includes as a special case the totally geodesic…

General Relativity and Quantum Cosmology · Physics 2021-04-20 Grigorios Fournodavlos , Jacques Smulevici

We provide a general contractibility criterion for subsets of Riemannian metrics on the disc. For instance, this result applies to the space of metrics that have positive Gauss curvature and make the boundary circle convex (or geodesic).…

Differential Geometry · Mathematics 2020-01-13 Alessandro Carlotto , Damin Wu

We obtain sharp convergence rates, using Dirichlet correctors, for solutions of wave equations in a bounded domain with rapidly oscillating periodic coefficients. The results are used to prove the exact boundary controllability that is…

Analysis of PDEs · Mathematics 2022-05-17 Fanghua Lin , Zhongwei Shen

Under the Ornstein-Uhlenbeck semigroup $\{U_t\}$, any non-negative measurable $f : \mathbb R^n \to \mathbb R_+$ exhibits a uniform tail bound better than that implied by Markov's inequality and conservation of mass: For every $\alpha \geq…

Probability · Mathematics 2018-05-23 Ronen Eldan , James R. Lee

An opaque set (or a barrier) for $U \subseteq \mathbb{R}^2$ is a set $B$ of finite-length curves such that any line intersecting $U$ also intersects $B$. In this paper, we consider the lower bound for the shortest barrier when $U$ is the…

Computational Geometry · Computer Science 2015-09-15 Taisuke Izumi

We describe the boundary behaviors of the squeezing functions for all bounded convex domains in $\mathbb{C}^n$ and bounded domains with a $C^2$ strongly convex boundary point.

Complex Variables · Mathematics 2013-06-12 Kang-Tae Kim , Liyou Zhang

We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy…

Information Theory · Computer Science 2019-10-17 Peter Boyvalenkov , Peter Dragnev , Douglas Hardin , Edward Saff , Maya Stoyanova

In this paper we approximate the convex envelope of a boundary datum inside a bounded domain in the Euclidean space. We work with a random graph that is obtained as random points with uniform distribution that are connected by proximity…

Analysis of PDEs · Mathematics 2026-03-24 Aurelia Deshayes , Nicolás Frevenza , Alfredo Miranda , Julio D. Rossi

We obtain assumption-free, non-asymptotic, uniform bounds on the product of the height and the width of uniformly random trees with a given degree sequence, conditioned Bienaym\'e trees and simply generated trees. We show that for a tree of…

Probability · Mathematics 2025-01-03 Serte Donderwinkel , Robin Khanfir

In this paper, we obtain estimates on the quantitative strata of the critical set of non-trivial harmonic functions $u$ which vanish continuously on $V \subset \partial \Omega$, a relatively open subset of the boundary of a convex domain…

Analysis of PDEs · Mathematics 2023-09-26 Sean McCurdy

Let $M$ be an $m$-dimensional compact Riemannian manifold with boundary. We obtain the upper bound of the harmonic mean of the first $m$ nonzero Neumann eigenvalues and Steklov eigenvalues involving the conformal volume and relative…

Differential Geometry · Mathematics 2026-01-23 Hang Chen

Let $C$ be a binary code of length $n$ with distances $0<d_1<\cdots<d_s\le n$. In this note we prove a general upper bound on the size of $C$ without any restriction on the distances $d_i$. The bound is asymptotically optimal.

Combinatorics · Mathematics 2025-03-13 Ivan Landjev , Konstantin Vorobev
‹ Prev 1 8 9 10 Next ›