48 problems
Let be a polynomial whose zero set is a plane curve consisting of the product of real lines. Consider the critical points of having the same non-zero critical valu…
Let a conic-line arrangement be an arrangement of lines and smooth conics in the complex projective plane with ordinary singularities, and let …
Let a line arrangement be a finite collection of lines in the complex projective plane, and let denote its characteristic number. For a real number…
Let be reduced curves in whose irreducible components are smooth and whose singularities are ordinary quasi-homogeneous singularities.…
Numerical Terao's conjecture. If are line arrangements satisfying
Maximal Tjurina existence conjecture. For every integer and every integer with , there are maximal Tjurina curves of type . Moreover, for…
For a reduced plane curve in , let denote its defect. A line arrangement is a union of finitely many lines in…
Let be a line arrangement of degree in the complex projective plane. Let denote the minimal degree of a Jacobian relation for , and…
Let be a reduced plane curve in . A point is modular if the central projection from induces a locally trivial fibration of the complement…
Let be a line arrangement that is not a union of concurrent lines, and let be a root of its Alexander polynomial . Suppose that the order of…
Diameter upper-bound conjecture. The number of diameters of does not exceed
Let be a sporadic simplicial line arrangement in , meaning a simplicial line arrangement outside the known infinite families, and let …
A simplicial line arrangement is a finite arrangement of lines in whose complement has only open triangular connected components. Grünbaum's catalogue…
Let registration marks be points in the plane, and consider the construction lines determined by the arrangement, subject to the two rules in Section 1. Upper-bound conje…
Four-line generation conjecture.
Deletion double-point conjecture. If is not free, then
Nonfree line-arrangement double-point conjecture. If is not free, then
Supersolvable Sylvester–Gallai conjecture. One has
Supersolvable arrangement double-point conjecture. One has
Let and be line arrangements with isomorphic intersection lattices … Let and be the associated rank vector bun…
Let and be arrangements of lines with isomorphic intersection lattices … Let denote the minimal degree of a Jacobian relation. S…
Let and be line arrangements with isomorphic intersection lattices … For an arrangement , let denote the minimal degre…
Let be a supersolvable line arrangement consisting of lines, and suppose that is not a pencil. Denote by the number of inters…
Let denote the number of crossing points of multiplicity in a complex line arrangement, and let be the number of its lines. A non-pencil complex supersolvable line ar…
Let denote the number of crossing points of multiplicity in a complex line arrangement. An arrangement is nontrivial if it is neither a pencil nor a near pencil, and it i…