Related papers: On complex supersolvable line arrangements

There are two invariants associated to any line arrangement: the freeness defect $\nu(C)$ and an upper bound for it, denoted by $\nu'(C)$, coming from a recent result by Uli Walther. We show that $\nu'(C)$ is combinatorially determined, at…

We characterize supersolvable lattices in terms of a certain modular type relation. McNamara and Thomas earlier characterized this class of lattices as those graded lattices having a maximal chain that consists of left-modular elements. Our…

A necklace can be considered as a cyclic list of $n$ red and $n$ blue beads in an arbitrary order, and the goal is to fold it into two and find a large cross-free matching of pairs of beads of different colors. We give a counterexample for…

For $d\geq 2$ and any norm on $\mathbb R^d$, we prove that there exists a set of $n$ points that spans at least $(\tfrac d2-o(1))n\log_2n$ unit distances under this norm for every $n$. This matches the upper bound recently proved by Alon,…

Let $ \mathcal{D} = \{D_{1}, ..., D_{\ell}\} $ be a multi-degree arrangement with normal crossings on the complex projective space $ \mathbf{P}^{n} $, with degrees $ d_{1}, ..., d_{\ell} $; let $ \Omega_{\mathbf{P}^{n}}^{1}(\log…

Generalizing a theorem of the first two authors and Geelen for planes, we show that, for a real-representable matroid $M$, either the average hyperplane-size in $M$ is at most a constant depending only on its rank, or each hyperplane of $M$…

We study sets of triple points of B\"{o}r\"{o}czky's arrangements of lines in the context of the containment problem proposed by Harbourne and Huneke. We show that in the class of those arrangements, the smallest counterexample to the…

Let $\mathcal{A} $ be a complexified-real arrangement of lines in $\mathbb{C}^2.$ Let $H$ be any line in $ \mathcal{A} $. Then, form a new complexified-real arrangement $ \mathcal{B}_H = \mathcal{A} \cup \mathcal{C} $ where $ \mathcal{C}…

Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…

We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…

We give a combinatorial model for the bounded derived category of graded modules over the dual numbers in terms of arcs on the integer line with a point at infinity. Using this model we describe the lattice of thick subcategories of the…

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…

A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…

We prove that a component of the closure of the set of star points on a hypersurface X of degree d>2 in N-dimensional projective space is linear. Afterwards, we focus on the case where the component is of maximal dimension N-2 and the case…

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…

A long standing question is if maximum number $\mu(d)$ of nodes on a surface of degree $d$ in $\dP^3(\dC)$ can be achieved by a surface defined over the reals which has only real singularities. The currently best known asymptotic lower…

We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…

For every $m \in {\C} \setminus \{0, -2\}$ and every nonnegative integer $k$ we define the vertex operator (super)algebra $D_{m,k}$ having two generators and rank $ \frac{3 m}{m + 2}$. If $m$ is a positive integer then $D_{m,k}$ can be…

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…

We call a multigraph {\em non-homotopic} if it can be drawn in the plane in such a way that no two edges connecting the same pair of vertices can be continuously transformed into each other without passing through a vertex, and no loop can…