English
Related papers

Related papers: A conditional bound on sphere tangencies in all di…

200 papers

A subset of the sphere is said short if it is contained in an open hemisphere. A short closed set which is geodesically convex is called a cap. The following theorem holds: 1. The minimal number of short closed sets covering the $n$-sphere…

Geometric Topology · Mathematics 2015-12-22 A. B. Németh

For the genus-$4$ Heegaard surface in the $3$-sphere, we present a sufficient condition for a non-separating weak reducing pair to be separated by a reducing sphere for the surface. As a consequence, we reduce the connectivity problem in…

Geometric Topology · Mathematics 2026-04-20 Sangbum Cho , Yuya Koda , Jung Hoon Lee

We obtain an upper bound to the packing density of regular tetrahedra. The bound is obtained by showing the existence, in any packing of regular tetrahedra, of a set of disjoint spheres centered on tetrahedron edges, so that each sphere is…

Metric Geometry · Mathematics 2010-11-23 Simon Gravel , Veit Elser , Yoav Kallus

We study the maximal number of triangulations that a planar set of $n$ points can have, and show that it is at most $30^n$. This new bound is achieved by a careful optimization of the charging scheme of Sharir and Welzl (2006), which has…

Discrete Mathematics · Computer Science 2010-01-03 Micha Sharir , Adam Sheffer

Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…

Closed formulae for upper bound on three tangles of three-qubit reduced states in terms of three-qubit invariant polynomials of pure four-qubit states are obtained. Our results offer tighter constraints on total three-way entanglement of a…

Quantum Physics · Physics 2017-06-07 S. Shelly Sharma , N. K. Sharma

We present a new proof (based on spectral decomposition) of a bound originally proved by Sidelnikov~\, for the frame potentials $\sum_{ij} \left( {\bf P}_i \cdot {\bf P}_j \right)^\ell $ on a unit--sphere in $d$ dimensions. Sidelnikov's…

Mathematical Physics · Physics 2024-12-10 Paolo Amore , Ricardo A. Sáenz

This paper provides the currently best known upper bound on the density of a packing in three-dimensional Euclidean space of two types of spheres whose size ratio is the largest one that allows the insertion of a small sphere in each…

Metric Geometry · Mathematics 2025-05-21 Thomas Fernique , Daria Pchelina

This paper solves the open problem on the sharp bound for the number of isolated solutions in $\mathbf{R}_*^n$ to the real system of $n$ polynomial equations in $n$ variables, i.e., the real $n$ by $n$ fewnomial system. For an unmixed…

Algebraic Geometry · Mathematics 2010-10-06 Sheng-Ming Ma

We introduce a class of minimal submanfolds $M^n$, $n\geq 3$, in spheres $\mathbb{S}^{n+2}$ that are ruled by totally geodesic spheres of dimension $n-2$. If simply-connected, such a submanifold admits a one-parameter associated family of…

Differential Geometry · Mathematics 2016-03-10 Marcos Dajczer , Theodoros Vlachos

The problem of twelve spheres is to understand, as a function of $r \in (0,r_{max}(12)]$, the configuration space of $12$ non-overlapping equal spheres of radius $r$ touching a central unit sphere. It considers to what extent, and in what…

Metric Geometry · Mathematics 2019-01-30 Rob Kusner , Wöden Kusner , Jeffrey C. Lagarias , Senya Shlosman

We prove that triangulations of homology spheres in any dimension grow much slower than general triangulations. Our bound states in particular that the number of triangulations of homology spheres in 3 dimensions grows at most like the…

Mathematical Physics · Physics 2015-06-15 Vincent Rivasseau

We construct a set of points with $\Omega(n^2\log n)$ triples determining an angle $\theta$ whenever $\tan(\theta)$ is algebraic over $\mathbb{Q}$, matching the upper bound of Pach and Sharir. This improves upon the original construction,…

Combinatorics · Mathematics 2022-01-27 Max Aires

This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate…

Computational Geometry · Computer Science 2009-12-21 Gun Srijuntongsiri , Stephen A. Vavasis

We give a new and elementary proof that the number of elastic collisions of a finite number of balls in the Euclidean space is finite. We show that if there are $n$ balls of equal masses and radii 1, and at the time of a collision between…

Dynamical Systems · Mathematics 2018-04-13 Krzysztof Burdzy , Mauricio Duarte

We study the crossing number of links that are formed by edges of a triangulation T of the 3-sphere with n tetrahedra. We show that the crossing number is bounded from above by an exponential function of n^2. In general, this bound can not…

Geometric Topology · Mathematics 2007-05-23 Simon A. King

We prove a maximal Fourier restriction theorem for the sphere $\mathbb{S}^{d-1}$ in $\mathbb{R}^{d}$ for any dimension $d\geq 3$ in a restricted range of exponents given by the Stein-Tomas theorem. The proof consists of a simple…

Classical Analysis and ODEs · Mathematics 2017-03-29 Marco Vitturi

Given a closed hyperbolic 3-manifold $M$, we construct a tower of covers with increasing Heegaard genus, and give an explicit lower bound on the Heegaard genus of such covers as a function of their degree. Using similar methods we prove…

Geometric Topology · Mathematics 2012-06-27 BoGwang Jeon

We prove the first inverse theorem for point--sphere incidence bounds over finite fields in dimensions $d \ge 3$, showing that near-extremality forces algebraic rigidity. While sharp upper bounds have been known for over a decade, the…

Combinatorics · Mathematics 2026-02-12 Shalender Singh , Vishnu Priya Singh

Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…

Computational Geometry · Computer Science 2013-04-15 Natan Rubin
‹ Prev 1 3 4 5 6 7 10 Next ›