Simplicial arrangements with up to 27 lines

DOI10.1007/S00454-012-9423-7zbMATH Open1254.52009arXiv1108.3000OpenAlexW2031939871MaRDI QIDQ714986FDOQ714986

Authors: Michael Cuntz 

Publication date: 15 October 2012

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: We compute all isomorphism classes of simplicial arrangements in the real projective plane with up to 27 lines. It turns out that Gr"unbaums catalogue is complete up to 27 lines except for four new arrangements with 22, 23, 24, 25 lines, respectively. As a byproduct we classify simplicial arrangements of pseudolines with up to 27 lines. In particular, we disprove Gr"unbaums conjecture about unstretchable arrangements with at most 16 lines, and prove the conjecture that any simplicial arrangement with at most 14 pseudolines is stretchable.

Full work available at URL: https://arxiv.org/abs/1108.3000

Recommendations

• Publication:3473734
• Simplicial arrangements revisited
• A catalogue of simplicial arrangements in the real projective plane
• The maximum number of triangles in arrangements of pseudolines
• Revisiting ``Small unstretchable simplical arrangements of pseudolines

zbMATH Keywords

arrangements of hyperplanessimplicial arrangementspseudolinewiring

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Cites Work

• Finite Weyl groupoids of rank three.
• Title not available (Why is that?)
• A catalogue of simplicial arrangements in the real projective plane
• Minimal fields of definition for simplicial arrangements in the real projective plane
• Title not available (Why is that?)
• Title not available (Why is that?)
• Semispaces of configurations, cell complexes of arrangements
• Crystallographic arrangements: Weyl groupoids and simplicial arrangements.
• Finite Weyl groupoids
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient enumeration of all ladder lotteries and its application

Cited In (30)

• A bound for crystallographic arrangements
• Unexpected curves arising from special line arrangements
• Milnor fibers of real line arrangements
• Supersolvable simplicial arrangements
• Grünbaum's gap conjecture
• Minimal fields of definition for simplicial arrangements in the real projective plane
• One hundred twenty-seven subsemilattices and planarity
• Simplicial arrangements on convex cones
• Symmetric simplicial pseudoline arrangements
• Congruence normality of simplicial hyperplane arrangements via oriented matroids
• A greedy algorithm to compute arrangements of lines in the projective plane
• Title not available (Why is that?)
• Countless Simson line configurations
• The containment problem and a rational simplicial arrangement
• Combinatorial simpliciality of arrangements of hyperplanes
• Homology graph of real arrangements and monodromy of Milnor fiber
• On Seshadri constants and point-curve configurations
• Revisiting ``Small unstretchable simplical arrangements of pseudolines
• Simplicial arrangements revisited
• Geometric, algebraic and topological combinatorics. Abstracts from the workshop held December 10--15, 2023
• Arrangements of lines with a minimum number of triangles are simple
• Tits arrangements on cubic curves
• Title not available (Why is that?)
• Algebraic geometry, commutative algebra and combinatorics: interactions and open problems
• A catalogue of simplicial arrangements in the real projective plane
• Logarithmic vector fields and freeness of divisors and arrangements: new perspectives and applications. Abstracts from the workshop held January 24--30, 2021 (online meeting)
• Some open questions about line arrangements in the projective plane
• New phenomena in the containment problem for simplicial arrangements
• A simplicial 3-arrangement of 22 planes
• A simplicial 3-arrangement of 21 planes

This page was built for publication: Simplicial arrangements with up to 27 lines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714986)