Name
Abstract | ||
|---|---|---|
Given a rank 3 real arrangement A of n lines in the projective plane, the Dirac–Motzkin conjecture (proved by Green and Tao in 2013) states that for n sufficiently large, the number of simple intersection points of A is greater than or equal to n/2. With a much simpler proof we show that if A is supersolvable, then the conjecture is true for any n (a small improvement of original conjecture). The Slope problem (proved by Ungar in 1982) states that n non-collinear points in the real plane determine at least n−1 slopes; we show that this is equivalent to providing a lower bound on the multiplicity of a modular point in any (real) supersolvable arrangement. In the second part we find connections between the number of simple points of a supersolvable line arrangement, over any field of characteristic 0, and the degree of the reduced Jacobian scheme of the arrangement. Over the complex numbers even though the Sylvester–Gallai theorem fails to be true, we conjecture that the supersolvable version of the Dirac–Motzkin conjecture is true. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.jcta.2016.01.001 | Journal of Combinatorial Theory, Series A |
Keywords | Field | DocType |
Dirac–Motzkin conjecture,Slope problem,Supersolvable arrangements | Discrete mathematics,Combinatorics,Complex number,Jacobian matrix and determinant,Upper and lower bounds,Multiplicity (mathematics),Projective plane,Geometry,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
140 | C | 0097-3165 |
Citations | PageRank | References |
1 | 0.48 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benjamin Anzis | 1 | 1 | 0.48 |
| Stefan O. Tohaneanu | 2 | 15 | 5.03 |