English
Related papers

Related papers: Ordinary planes, coplanar quadruples, and space qu…

200 papers

In the present note we provide a partial classification of nearly free conic-line arrangements in the complex plane having nodes, tacnodes, and ordinary triple points. In this setting, our theoretical bound tells us that the degree of such…

Algebraic Geometry · Mathematics 2022-07-05 Aleksandra Gałecka

When W is a finite Coxeter group of classical type (A, B, or D), noncrossing partitions associated to W and compatibility of almost positive roots in the associated root system are known to be modeled by certain planar diagrams. We show how…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

We construct a collection of higher Chow cycles on certain surfaces which degenerate to an arrangement of planes in general position. When its degree is 4, this construction gives a new explicit proof of the Hodge-D-Conjecture for a certain…

Algebraic Geometry · Mathematics 2021-06-08 Tokio Sasaki

We show that there are only finitely many combinatorial types of free real line arrangements with only double, triple and quadruple intersection points, and we enlist all admissible weak-combinatorics of them. Then we classify all real…

Algebraic Geometry · Mathematics 2025-10-01 Marek Janasz , Izabela Leśniak

In the three-dimensional projective space PG(3,q) over the finite field F_q with q elements, we consider the normal rational curve known as a twisted cubic and the projectivity group G_q that fixes it. For q = 2, 3, 4, we solve the open…

Combinatorics · Mathematics 2026-05-19 Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

For a pair of points in a smooth locally convex surface in 3-space, its mid-plane is the plane containing its mid-point and the intersection line of the corresponding pair of tangent planes. In this paper we show that the limit of…

Differential Geometry · Mathematics 2017-05-08 Ady Cambraia Junior , Marcos Craizer

Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…

Number Theory · Mathematics 2020-12-29 Aram Bingham

If two closed Jordan curves in the plane have precisely one point in common, then it is called a {\em touching point}. All other intersection points are called {\em crossing points}. The main result of this paper is a Crossing Lemma for…

Combinatorics · Mathematics 2015-07-08 János Pach , Natan Rubin , Gábor Tardos

It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…

Computational Geometry · Computer Science 2019-09-05 Michael Hoffmann , Csaba D. Tóth

We prove that any complete, uniformly elliptic Weingarten surface in Euclidean $3$-space whose Gauss map image omits an open hemisphere is a cylinder or a plane. This generalizes a classical theorem by Hoffman, Osserman and Schoen for…

Differential Geometry · Mathematics 2020-07-23 Isabel Fernandez , Jose A. Galvez , Pablo Mira

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

A well-known theorem of de Bruijn and Erd\H{o}s states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chv\'{a}tal asked whether an analogous statement holds within the framework of finite…

Combinatorics · Mathematics 2012-07-17 Ida Kantor , Balazs Patkos

We study three covering problems in the plane. Our original motivation for these problems come from trajectory analysis. The first is to decide whether a given set of line segments can be covered by up to four unit-sized, axis-parallel…

Computational Geometry · Computer Science 2022-05-03 Joachim Gudmundsson , Mees van de Kerkhof , André van Renssen , Frank Staals , Lionov Wiratma , Sampson Wong

Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…

Combinatorics · Mathematics 2025-02-14 Hailong Dao , Manik Dhar , Izabella Łaba , Ben Lund

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

A set of $n$ points in the Euclidean plane determines at least $n$ distinct lines unless these $n$ points are collinear. In 2006, Chen and Chv\'atal asked whether the same statement holds true in general metric spaces, where the line…

Combinatorics · Mathematics 2021-10-26 Vašek Chvátal

In this paper we discuss the relationship between the moving planes of a rational parametric surface and the singular points on it. Firstly, the intersection multiplicity of several planar curves is introduced. Then we derive an equivalent…

Numerical Analysis · Mathematics 2010-01-14 Falai Chen , Xuhui Wang

A finite, normal cover $f: X\longrightarrow \bbP^2$ of degree $m\geq 3$ (the case $m=2$ is well known and we do not consider it in this paper) is called \emph{simple}, if there is a pencil $\mathcal P$ of rational curves of $\bbP^2$ such…

Algebraic Geometry · Mathematics 2026-03-24 Ciro Ciliberto , Rick Miranda

A regular linear line complex is a three-parameter set of lines in space, whose Pl\"ucker vectors lie in a hyperplane, which is not tangent to the Klein quadric. Our main result is a bound $O(n^{1/2}m^{3/4} + m+n)$ for the number of…

Combinatorics · Mathematics 2021-07-01 Misha Rudnev

We consider here 6-regular plane graphs whose faces have size 1, 2 or 3. In Section 2 a practical enumeration method is given that allowed us to enumerate them up to 53 vertices. Subsequently, in Section 3 we enumerate all possible symmetry…

Combinatorics · Mathematics 2010-07-28 Michel Deza , Mathieu Dutour Sikiric