English
Related papers

Related papers: Acute sets

200 papers

Let $\mathcal{S}$ be a finite set of integer points in $\mathbb{R}^d$, which we assume has many symmetries, and let $P\in\mathbb{R}^d$ be a fixed point. We calculate the distances from $P$ to the points in $\mathcal{S}$ and compare the…

Combinatorics · Mathematics 2023-09-28 Jack Anderson , Cristian Cobeli , Alexandru Zaharescu

Minimizing the Euclidean distance to a set arises frequently in applications. When the set is algebraic, a measure of complexity of this optimization problem is its number of critical points. In this paper we provide a general framework to…

Optimization and Control · Mathematics 2015-06-17 Dmitriy Drusvyatskiy , Hon-Leung Lee , Rekha R. Thomas

The number of triangulations of a planar n point set is known to be $c^n$, where the base $c$ lies between $2.43$ and $30.$ The fastest known algorithm for counting triangulations of a planar n point set runs in $O^*(2^n)$ time. The fastest…

Computational Geometry · Computer Science 2014-11-21 Marek Karpinski , Andrzej Lingas , Dzmitry Sledneu

A collection $ \Delta $ of simple closed curves on an orientable surface is an algebraic $ k $-system if the algebraic intersection number $\langle \alpha,\beta \rangle$ is equal to $k $ in absolute value for every $ \alpha , \beta \in…

Geometric Topology · Mathematics 2020-02-17 Charles Daly , Jonah Gaster , Max Lahn , Aisha Mechery , Simran Nayak

An {\em eight-partition} of a finite set of points (respectively, of a continuous mass distribution) in $\mathbb{R}^3$ consists of three planes that divide the space into $8$ octants, such that each open octant contains at most $1/8$ of the…

Computational Geometry · Computer Science 2025-05-19 Boris Aronov , Abdul Basit , Indu Ramesh , Gianluca Tasinato , Uli Wagner

Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…

Combinatorics · Mathematics 2008-04-09 Sascha Kurz , Alfred Wassermann

The mass spectrum of the 3d 3-state Potts model is considered in the broken phase (a) near the second order Ising critical point in the temperature-magnetic field plane and (b) near the weakly first order transition point at zero magnetic…

High Energy Physics - Lattice · Physics 2011-01-25 R. Falcone , R. Fiore , M. Gravina , A. Papa

Let $P$ be a finite set of points in the plane. A c-ordinary triangle is a set of three non-collinear points of $P$ such that each line spanned by the points contains at most $c$ points of $P$. We show that if $P$ is not contained in the…

Combinatorics · Mathematics 2018-06-28 Quentin Dubroff

Let us consider the set of joint quantum correlations arising from two-outcome local measurements on a bipartite quantum system. We prove that no finite dimension is sufficient to generate all these sets. We approach the problem in two…

Quantum Physics · Physics 2013-05-29 T. Vértesi , K. F. Pál

We show that in doubling, geodesic metric measure spaces (including, for example, Euclidean space), sets of positive measure have a certain large-scale metric density property. As an application, we prove that a set of positive measure in…

Classical Analysis and ODEs · Mathematics 2024-04-19 Guy C. David , Brandon Oliva

We improve the well-known Szemer\'edi-Trotter incidence bound for proper 3--dimensional point sets (defined appropriately)

Combinatorics · Mathematics 2011-09-06 György Elekes

We recall the definition of an r-maximal set in a metric space as a maximal subset of diameter r. In the special case when the metric space is Euclidean such a set is exactly a solid of constant diameter r. In the process of reviewing the…

Dynamical Systems · Mathematics 2010-08-17 Ethan Akin

In this paper we compute upper bounds for the number of ordinary triple points on a hypersurface in $P^3$ and give a complete classification for degree six (degree four or less is trivial, and five is elementary). But the real purpose is to…

Algebraic Geometry · Mathematics 2007-05-23 Stephan Endraß , Ulf Persson , Jan Stevens

We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double circle and double chain. The latter has asymptotically $12^n…

Combinatorics · Mathematics 2009-07-07 Oswin Aichholzer , David Orden , Francisco Santos , Bettina Speckmann

Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is sometimes useful or required to compute what one might call the ``shape'' of the set. For that purpose, this paper introduces the formal…

Combinatorics · Mathematics 2016-09-06 Herbert Edelsbrunner , Ernst Mücke

This paper makes a deep study of regular two-distance sets. A set of unit vectors $X$ in Euclidean space $\RR^n$ is said to be regular two-distance set if the inner product of any pair of its vectors is either $\alpha$ or $\beta$, and the…

Functional Analysis · Mathematics 2019-10-17 Peter G. Casazza , Tin T. Tran , Janet C. Tremain

Let P be a set of n points in $\mathbb{R}^d$. A point x is said to be a centerpoint of P if x is contained in every convex object that contains more than $dn\over d+1$ points of P. We call a point x a strong centerpoint for a family of…

Computational Geometry · Computer Science 2012-08-15 Pradeesha Ashok , Umair Azmi , Sathish Govindarajan

We consider shifts of a set $A\subseteq\mathbb{N}$ by elements from another set $B\subseteq\mathbb{N}$, and prove intersection properties according to the relative asymptotic size of $A$ and $B$. A consequence of our main theorem is the…

Combinatorics · Mathematics 2014-12-01 Mauro Di Nasso

A set of rational points on a curve is said to be in geometric progression if either the abscissae or the ordinates of the points are in geometric progression. Examples of three points in geometric progression on a circle are already known.…

Number Theory · Mathematics 2023-11-14 Ajai Choudhry

Let S be a set of 2n+1 points in the plane such that no three are collinear and no four are concyclic. A circle will be called point-splitting if it has 3 points of S on its circumference, n-1 points in its interior and n-1 in its exterior.…

Combinatorics · Mathematics 2007-05-23 Federico Ardila M
‹ Prev 1 8 9 10 Next ›