Related papers: Counting Lines with Vinberg's algorithm

We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of $n$ points in the plane can be covered using $k$ lines. Line Cover is known to be NP-hard, and we focus on two natural generalizations. The first is…

We study K3 surfaces with 9 cusps, i.e. 9 disjoint $A_2$ configurations of smooth rational curves, over algebraically closed fields of characteristic $p\neq 3$. Much like in the complex situation studied by Barth, we prove that each such…

We investigate configurations of rational double points with the total Milnor number 21 on supersingular $K3$ surfaces. The complete list of possible configurations is given. As an application, we also give the complete list of extremal…

We define the \emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to…

We discuss properties of the Seifert form for simple $K3$ singularities, and of the Picard lattices of families of weighted $K3$ surfaces. We study a collection $\mathcal{M}_{(\rho,\,\delta)}$ of $K3$ surfaces polarized by their Picard…

We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…

This is an expanded version of our work [AN88], 1988, in Russian. We classify del Pezzo surfaces over C with log terminal singularities of index \le 2. By classification, we understand a description of the intersection graph of all…

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…

For a line arrangement in the complex projective plane $\mathbb{P}^2$, we investigate the compactification $\overline{F}$ of the affine Milnor fiber in $\mathbb{P}^3$ and its minimal resolution $\widetilde{F}$. We compute the Chern numbers…

In general, not much is known about the arithmetic of K3 surfaces. Once the geometric Picard number, which is the rank of the Neron-Severi group over an algebraic closure of the base field, is high enough, more structure is known and more…

We study the fixed singularities imposed on members of a linear system of surfaces in P^3_C by its base locus Z. For a 1-dimensional subscheme Z \subset P^3 with finitely many points p_i of embedding dimension three and d >> 0, we determine…

We report on our project to find explicit examples of $K3$ surfaces having real or complex multiplication. Our strategy is to search through the arithmetic consequences of RM and CM. In order to do this, an efficient method is needed for…

We present a simple, accurate method for computing singular or nearly singular integrals on a smooth, closed surface, such as layer potentials for harmonic functions evaluated at points on or near the surface. The integral is computed with…

We prove that any non-isotrivial elliptic K3 surface over an algebraically closed field $k$ of arbitrary characteristic contains infinitely many rational curves. In the case when $\mathrm{char}(k)\neq 2,3$, we prove this result for any…

We prove a bound on the number of lines on a smooth degree-d surface in three-dimensional projective space for $d \geq 3$. This bound improves a bound due to Segre and renders some of his arguments rigorous. It is the best known bound for…

Miyaoka proved that a smooth surface of degree $d$ in ${\mathbf{P}}^3({\mathbb{C}})$ contains at most $2d(d-2)$ pairwise disjoint lines. In this note, we verify that the Maschke octic contains $96$ pairwise disjoint lines, thereby proving…

A graph drawn in the plane is called k-quasi-planar if it does not contain k pairwise crossing edges. It has been conjectured for a long time that for every fixed k, the maximum number of edges of a k-quasi-planar graph with n vertices is…

We examine several types of visibility graphs in which sightlines can pass through $k$ objects. For $k \geq 1$ we bound the maximum thickness of semi-bar $k$-visibility graphs between $\lceil \frac{2}{3} (k + 1) \rceil$ and $2k$. In…

Given d in IN, we prove that any polarized Enriques surface (over any field of characteristic different from 2 or with a smooth K3 cover) of degree greater than 12d^2 contains at most 12 rational curves of degree at most d. For d>2 we…

Consider a set of $ n $ points on a plane. A line containing exactly $ 3 $ out of the $ n $ points is called a $ 3 $-rich line. The classical orchard problem asks for a configuration of the $ n $ points on the plane that maximizes the…