Related papers: On Very Generic Discriminantal Arrangements
Finite convex geometries are combinatorial structures. It follows from a recent result of M.\ Richter and L.G.\ Rogers that there is an infinite set $T_{rr}$ of planar convex polygons such that $T_{rr}$ with respect to geometric convex…
We study the problems of testing and learning high-dimensional discrete convex sets. The simplest high-dimensional discrete domain where convexity is a non-trivial property is the ternary hypercube, $\{-1,0,1\}^n$. The goal of this work is…
Drawing parallels with hyperplane arrangements, we develop the theory of arrangements of submanifolds. Given a smooth, finite dimensional, real manifold $X$ we consider a finite collection $\mathcal{A}$ of locally flat, codimension-1…
We generalise the existence of combinatorial designs to the setting of subset sums in lattices with coordinates indexed by labelled faces of simplicial complexes. This general framework includes the problem of decomposing hypergraphs with…
Given a finite set of non-collinear points in the plane, there exists a line that passes through exactly two points. Such a line is called an ordinary line. An efficient algorithm for computing such a line was proposed by Mukhopadhyay et…
Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…
We show that certain families of sets in $\mathbb{R}^2$ (or $\mathbb{R}^n$) which are neither definable nor have bounded VC-dimension are nonetheless uniformly approximately definable in the real field, an o-minimal structure.
The separation of two sets (or more specific of two cones) plays an important role in different fields of mathematics such as variational analysis, convex analysis, convex geometry, optimization. In the paper, we derive some new results for…
A Fuchsian system of rank 8 in 3 variables with 4 parameters is presented. The singular locus consists of six planes and a cubic surface. The restriction of the system onto the intersection of two singular planes is an ordinary differential…
It is well established that a general pair of twisted cubic curves in complex projective space has ten common secant lines. As an initial investigation, we show that the monodromy group of the ten common secant lines over the complex…
The purpose of this note is to study configurations of lines in projective planes over arbitrary fields having the maximal number of intersection points where three lines meet. We give precise conditions on ground fields F over which such…
Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be described combinatorially by a regular labeling: an assignment of colors and orientations to the edges of an…
G\"unter Ziegler has shown in 1989 that some homological invariants associated with the free resolutions of Jacobian ideals of line arrangements are not determined by combinatorics. His classical example involves hexagons inscribed in…
Concatenation hierarchies are classifications of regular languages. All such hierarchies are built through the same construction process: start from an initial class of languages and build new levels using two generic operations.…
Let $X$ be a hypersurface of degree $d$ in $\Bbb P^n$ and $F_X$ be the scheme of $\Bbb P^r$'s contained in $X$. If $X$ is generic, then $F_X$ will have the expected dimension (or empty) and its class in the Chow ring of $G(r+1,n+1)$ is…
A projective rectangle is like a projective plane that may have different lengths in two directions. We develop properties of the graph of lines, in which adjacency means having a common point, especially its strong regularity and clique…
An ordinary plane of a finite set of points in real 3-space with no three collinear is a plane intersecting the set in exactly three points. We prove a structure theorem for sets of points spanning few ordinary planes. Our proof relies on…
The Szemer\'edi-Trotter theorem gives a bound on the maximum number of incidences between points and lines on the Euclidean plane. In particular it says that $n$ lines and $n$ points determine $O(n^{4/3})$ incidences. Let us suppose that an…
Line congruences are $2$-dimensional families of lines in $3$-space. The singularities that appear in generic line congruences are folds, cusps and swallowtails. In this paper we give a geometric description of these singularities. The main…
A hyperplane arrangement is said to satisfy the ``Riemann hypothesis'' if all roots of its characteristic polynomial have the same real part. This property was conjectured by Postnikov and Stanley for certain families of arrangements which…