English
Related papers

Related papers: On sets defining few ordinary solids

200 papers

We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an…

Discrete Mathematics · Computer Science 2017-06-01 Valentin Gledel , Aline Parreau

A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…

Combinatorics · Mathematics 2014-12-30 Pierre Aboulker , Xiaomin Chen , Guangda Huzhang , Rohan Kapadia , Cathryn Supko

We show that the number of unit-area triangles determined by a set $S$ of $n$ points in the plane is $O(n^{20/9})$, improving the earlier bound $O(n^{9/4})$ of Apfelbaum and Sharir [Discrete Comput. Geom., 2010]. We also consider two…

Combinatorics · Mathematics 2015-04-14 Orit E. Raz , Micha Sharir

We study the orchard problem on cubic surfaces. We classify possibly reducible cubic surfaces $X\subseteq \mathbb{P}^3(\C)$ with smooth components on which there exist families of finite sets (of unbounded size) with quadratically many…

Logic · Mathematics 2025-11-03 Martin Bays , Jan Dobrowolski , Tingxiang Zou

We prove an incidence theorem for points and planes in the projective space $\mathbb P^3$ over any field $\mathbb F$, whose characteristic $p\neq 2.$ An incidence is viewed as an intersection along a line of a pair of two-planes from two…

Combinatorics · Mathematics 2015-12-07 Misha Rudnev

We introduce the theory of div point sets, which aims to provide a framework to study the combinatoric nature of any set of points in general position on an Euclidean plane. We then show that proving the unsatisfiability of some first-order…

Combinatorics · Mathematics 2019-09-02 Archy Will He

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 first review some topics in the classical computational geometry of lines, in particular the O(n^{3+\epsilon}) bounds for the combinatorial complexity of the set of lines in R^3 interacting with $n$ objects of fixed description…

Metric Geometry · Mathematics 2007-05-23 Frank Sottile , Thorsten Theobald

The Separation Problem asks for the minimum number s(O,K) of hyperplanes required to strictly separate any interior point O of a convex body K from all faces of K. The Conjecture is s(O,K) is at most 2 to the power d in real d-space , and…

Combinatorics · Mathematics 2017-03-14 T. Bisztriczky

We prove that for every natural number k there are simply connected topological four-manifolds which have at leat k distinct smooth structures supporting Einstein metrics, and also have infinitely many distinct smooth structures not…

Geometric Topology · Mathematics 2007-05-23 V. Braungardt , D. Kotschick

We prove that 1) There exist infinitely many non-trivial codimension one "thick" knots in $\mathbb{R}^5$; 2) For each closed four-dimensional smooth manifold $M$ and for each sufficiently small positive $\epsilon$ the set of isometry…

Metric Geometry · Mathematics 2016-03-17 Boris Lishak , Alexander Nabutovsky

We will show that for any $n\ge N$ points on the $N$-dimensional sphere $S^N$ there is a closed hemisphere which contains at least $\lfloor\frac{n+N+1}{2}\rfloor$ of these points. This bound is sharp and we will calculate the amount of sets…

Metric Geometry · Mathematics 2007-05-23 Jan Fricke

Fix $k \geq 6$. We prove that any large enough finite group $G$ contains $k$ elements which span quadratically many triples of the form $(a,b,ab) \in S \times G$, given any dense set $S \subseteq G \times G$. The quadratic bound is…

Combinatorics · Mathematics 2019-02-22 Ching Wong

We show, in this first part, that the maximal number of singular points of a normal quartic surface $X \subset \mathbb{P}^3_K$ defined over an algebraically closed field $K$ of characteristic $2$ is at most $16$. We produce examples with…

Algebraic Geometry · Mathematics 2022-01-24 Fabrizio Catanese

We prove that if $N$ points lie in convex position in the plane then they determine $\Omega(N^{5/4})$ distinct angles, provided that the points do not lie on a common circle. This is derived from a more general claim that if $N$ points in…

Combinatorics · Mathematics 2025-10-14 Sergei V. Konyagin , Jonathan Passant , Misha Rudnev

Newton-Okounkov bodies serve as a bridge between algebraic geometry and convex geometry, enabling the application of combinatorial and geometric methods to the study of linear systems on algebraic varieties. This paper contributes to…

Algebraic Geometry · Mathematics 2025-01-31 Yue Yu

We consider smooth surfaces $S \subset \Pq$ containing a plane curve $P$ and prove some general result concerning the linear system $|H-P|$. We then look at regular surfaces lying on hypersurfaces of degree $s$ having a plane of…

Algebraic Geometry · Mathematics 2007-05-23 Ph. Ellia , C. Folegatti

It is a classical result that there are $12$ (irreducible) rational cubic curves through $8$ generic points in $\mathbb{P}_{\mathbb{C}}^2$, but little is known about the non-generic cases. The space of $8$-point configurations is…

Algebraic Geometry · Mathematics 2023-09-15 Taylor Brysiewicz , Fulvio Gesmundo , Avi Steiner

Planar point sets with many triple lines (which contain at least three distinct points of the set) have been studied for 180 years, started with Jackson and followed by Sylvester. Green and Tao has shown recently that the maximum possible…

Combinatorics · Mathematics 2013-02-26 György Elekes , Endre Szabó

A set P of points in R^2 is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n>=15. Conversely,…

Computational Geometry · Computer Science 2013-08-28 Jean Cardinal , Michael Hoffmann , Vincent Kusters