The generalized Sylvester's and orchard problems via discriminantal arrangement
DOI10.2140/IIG.2024.21.117zbMATH Open1544.05022MaRDI QIDQ6596719
Elisa Palezzato, P. Das, Simona Settepanella
Publication date: 2 September 2024
Published in: Innovations in Incidence Geometry (Search for Journal in Brave)
line arrangementsSylvester's problemintersection latticeorchard problemdiscriminantal arrangementsnon-very generic arrangements
Grassmannians, Schubert varieties, flag manifolds (14M15) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On sets defining few ordinary lines
- The orchard problem
- Discriminantal arrangements, fiber polytopes and formality
- The largest intersection lattice of a discriminantal arrangement
- Discriminantal arrangement, \(3{\times}3\) minors of Plücker matrix and hypersurfaces in Grassmannian \(\mathrm{Gr}(3, n)\)
- On the Sylvester-Gallai and the orchard problem for pseudoline arrangements
- On the non-very generic intersections in discriminantal arrangements
- Line arrangements with the maximal number of triple points
- Arrangements of Lines with a Large Number of Triangles
- Strata of discriminantal arrangements
- Pappus's Theorem in Grassmannian Gr(3, ℂ^n)
This page was built for publication: The generalized Sylvester's and orchard problems via discriminantal arrangement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596719)
