English
Related papers

Related papers: Real Line Arrangements and Surfaces with Many Real…

200 papers

We settle a problem of Dujmovi\'c, Eppstein, Suderman, and Wood by showing that there exists a function $f$ with the property that every planar graph $G$ with maximum degree $d$ admits a drawing with noncrossing straight-line edges, using…

Combinatorics · Mathematics 2010-11-13 Balázs Keszegh , János Pach , Dömötör Pálvölgyi

The structured singular value $\mu$ was introduced independently by Doyle and Safanov as a tool for analyzing robustness of system stability and performance in the presence of structured uncertainty in the system parameters. While the…

Optimization and Control · Mathematics 2014-08-05 Joseph A. Ball , Gilbert J. Groenewald , Sanne ter Horst

Algebraic surfaces in the complex projective space with a high number of A-type singularities have been presented in a recent paper. We extend the construction in order to obtain lower bounds for the maximal number of A singularities for…

Algebraic Geometry · Mathematics 2026-05-25 Juan García Escudero

We study projective surfaces $X \subset \mathbb{P}^r$ (with $r \geq 5$) of maximal sectional regularity and degree $d > r$, hence surfaces for which the Castelnuovo-Mumford regularity $\reg(\mathcal{C})$ of a general hyperplane section…

Algebraic Geometry · Mathematics 2015-02-09 Markus Brodmann , Wanseok Lee , Euisung Park , Peter Schenzel

A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining…

Computational Geometry · Computer Science 2014-10-24 Stylianos C. Despotakis , Ioannis Z. Emiris

In this paper, we study combinatorial aspects of reduced plane curves known as $\mathscr{M}$-curves. This notation is a natural generalization of maximizing plane curves which are well-known in the theory of algebraic surfaces. We focus…

Algebraic Geometry · Mathematics 2026-01-01 Marek Janasz , Piotr Pokora

A topological graph drawn on a cylinder whose base is horizontal is \emph{angularly monotone} if every vertical line intersects every edge at most once. Let $c(n)$ denote the maximum number $c$ such that every simple angularly monotone…

Combinatorics · Mathematics 2013-07-17 Radoslav Fulek

We combine classical Vinberg's algorithms with the lattice-theoretic/arithmetic approach from arXiv:1706.05734 [math.AG] to give a method of classifying large line configurations on complex quasi-polarized K3-surfaces. We apply our method…

Algebraic Geometry · Mathematics 2025-05-19 Alex Degtyarev , Sławomir Rams

Recently we gave arguments that only two unique topologically different configurations of 7 equal all mutually touching round cylinders (the configurations being mirror reflections of each other) are possible in 3D, although a whole world…

Metric Geometry · Mathematics 2018-04-26 Peter V. Pikhitsa , Stanislaw Pikhitsa

We construct a $3$-dimensional area minimizing current $T$ in $\mathbb{R}^5$ whose boundary contains a real analytic surface of multiplicity $2$ at which $T$ has a density $1$ essential boundary singularity with a flat tangent cone. This…

Analysis of PDEs · Mathematics 2025-07-11 Ian Fleschler

We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…

Algebraic Geometry · Mathematics 2007-05-23 Steven Kleiman , Ragni Piene

This paper develops new tools for understanding surfaces with more than one end (and usually, of infinite topology) which properly minimally embed into Euclidean three-space. On such a surface, the set of ends forms a compact Hausdorff…

Differential Geometry · Mathematics 2019-08-19 Pascal Collin , Robert Kusner , William H. Meeks , III , Harold Rosenberg

This thesis addresses the question of the maximal number of $d$-simplices for a simplicial complex which is embeddable into $\mathbb{R}^r$ for some $d \leq r \leq 2d$. A lower bound of $f_d(C_{r + 1}(n)) =…

Combinatorics · Mathematics 2018-12-21 Anna Gundert

Let ${\cal L}$ be an arrangement of $n$ lines in the Euclidean plane. The \emph{$k$-level} of ${\cal L}$ consists of all vertices $v$ of the arrangement which have exactly $k$ lines of ${\cal L}$ passing below $v$. The complexity (the…

Computational Geometry · Computer Science 2020-03-10 Man-Kwun Chiu , Stefan Felsner , Manfred Scheucher , Patrick Schnider , Raphael Steiner , Pavel Valtr

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

Computational Geometry · Computer Science 2020-03-17 M. Sharir , C. Ziv

We improve the current best bound for distinct distances on non-ruled algebraic surfaces in ${\mathbb R}^3$. In particular, we show that $n$ points on such a surface span $\Omega\left(n^{32/39-\varepsilon}\right)$ distinct distances, for…

Combinatorics · Mathematics 2021-12-30 Surya Mathialagan , Adam Sheffer

In 1946 Erd\H os asked for the maximum number of unit distances, $u(n)$, among $n$ points in the plane. He showed that $u(n)> n^{1+c/\log\log n}$ and conjectured that this was the true magnitude. The best known upper bound is…

Combinatorics · Mathematics 2014-04-22 Ryan Schwartz , József Solymosi , Frank de Zeeuw

For an arrangement of $n$ pseudolines in the real projective plane let us denote by $t_i$ the number of vertices incident to $i$ lines. We obtain a linear on $t_i$ inequality similar to the Hirzebruch one, but with an elementary proof. We…

Combinatorics · Mathematics 2012-03-07 Igor Shnurnikov

We prove that there exists a>0 such that for any integer d>2 and any topological types S_1,...,S_n of plane curve singularities, satisfying $\mu(S_1)+...+\mu(S_n) \leq ad^2$, there exists a reduced irreducible plane curve of degree d with…

alg-geom · Mathematics 2009-10-30 Gert-Martin Greuel , Christoph Lossen , Eugenii Shustin

Fulton asked how many solutions to a problem of enumerative geometry can be real, when that problem is one of counting geometric figures of some kind having specified position with respect to some general fixed figures. For the problem of…

Algebraic Geometry · Mathematics 2007-05-23 Frank Sottile