Related papers: On incidences of lines in regular complexes

We study a generalization of Erd\H os's unit distances problem to chains of $k$ distances. Given $\mathcal P,$ a set of $n$ points, and a sequence of distances $(\delta_1,\ldots,\delta_k)$, we study the maximum possible number of tuples of…

Let $D^+$ be the first octant of the Euclidean space and consider the integral cube grid $G$ in $D^+$. The intersections of each line with $G$ form an infinite sequence of three letters which can be considered as an extension of well-known…

The space ${\Bbb{L}}$ of oriented lines, or rays, in ${\Bbb{R}}^3$ is a 4-dimensional space with an abundance of natural geometric structure. In particular, it boasts a neutral K\"ahler metric which is closely related to the Euclidean…

The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear…

A line arrangement of $3n$ lines in $\mathbb CP^2$ satisfies Hirzebruch property if each line intersect others in $n+1$ points. Hirzebruch asked if all such arrangements are related to finite complex reflection groups. We give a positive…

In this paper, we investigate three fundamental problems regarding cut complexes of graphs: their realizability, the uniqueness of graph reconstruction from them, and their algorithmic recognition. We define the parameter $m(d,n)$ as the…

A metrized complex of algebraic curves is a finite metric graph together with a collection of marked complete nonsingular algebraic curves, one for each vertex, the marked points being in bijection with incident edges. We establish a…

Let $f_1,\cdots,f_r\in k[x_1,\cdots,x_n]$ be homogeneous polynomial of degree $d$. Ananyan and Hochster (2016) proved that there exists a bound $N=N(r,d)$ where if collective strength of $f_1,\cdots,f_r\geq N$, then $f_1,\cdots,f_r$ are…

Detecting polygons defined by a set of line segments in a plane is an important step in analyzing vector drawings. This paper presents an approach combining several algorithms to detect basic polygons from arbitrary line segments. The…

The three distance theorem (also known as the three gap theorem or Steinhaus problem) states that, for any given real number $\alpha$ and integer $N$, there are at most three values for the distances between consecutive elements of the…

In the spirit of Klein's Erlangen Program, we investigate the geometric and algebraic structure of fundamental line complexes and the underlying privileged discrete integrable system for the minors of a matrix which constitute associated…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several interesting identities involving this sequence such as $F_n^2+F_{n+1}^2=F_{2n+1}$, for all $n\geq…

The scaled standard Wigner matrix (symmetric with mean zero, variance one i.i.d. entries), and its limiting eigenvalue distribution, namely the semi-circular distribution, has attracted much attention. The $2k$th moment of the limit equals…

We propose and study a generalization to the well-known problem of polyline simplification. Instead of a single polyline, we are given a set of $\ell$ polylines possibly sharing some line segments and bend points. Our goal is to minimize…

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the minimum number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We find lower bounds linear in $n$ for…

In trying to generalize the classic Sylvester-Gallai theorem and De Bruijn-Erd\H{o}s theorem in plane geometry, lines and closure lines were previously defined for metric spaces and hypergraphs. Both definitions do not obey the geometric…

For each integer $D\ge3$, we give a sharp bound on the number of lines contained in a smooth complex $2D$-polarized $K3$-surface in $\mathbb{P}^{D+1}$. In the two most interesting cases of sextics in $\mathbb{P}^4$ and octics in…

We introduce a natural class of models of random chain complexes of real vector spaces that some classical ensembles of random matrices, the length $1$ case. We are interested here in the homological properties of these random complexes.…

In this article we obtain the classification of the congruences of lines with one-dimensional focal locus. It turns out that one can restrict to study the case of $\mathbb{P}^3$.

Scheinerman and Wilf (1994) assert that `an important open problem in the study of graph embeddings is to determine the rectilinear crossing number of the complete graph K_n.' A rectilinear drawing of K_n is an arrangement of n vertices in…