Supersolvable simplicial arrangements
From MaRDI portal
Publication:2423400
DOI10.1016/J.AAM.2019.02.008zbMath1492.52009arXiv1712.01605OpenAlexW2774621083WikidataQ128284534 ScholiaQ128284534MaRDI QIDQ2423400
Publication date: 21 June 2019
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.01605
root systemhyperplane arrangementsCoxeter graphsupersolvable arrangementsreflection arrangementssimplicial arrangements
Reflection and Coxeter groups (group-theoretic aspects) (20F55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Related Items (5)
Congruence normality of simplicial hyperplane arrangements via oriented matroids ⋮ Logarithmic vector fields and freeness of divisors and arrangements: new perspectives and applications. Abstracts from the workshop held January 24--30, 2021 (online meeting) ⋮ A greedy algorithm to compute arrangements of lines in the projective plane ⋮ A bound for crystallographic arrangements ⋮ Accurate arrangements
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal fields of definition for simplicial arrangements in the real projective plane
- Supersolvable restrictions of reflection arrangements
- A simplicial complex of Nichols algebras
- Simplicial arrangements with up to 27 lines
- Combinatorial simpliciality of arrangements of hyperplanes
- Weyl groupoids with at most three objects.
- Simplicial arrangements on convex cones
- Tits arrangements on cubic curves
- Finite Weyl groupoids
- Supersolvable lattices
- A catalogue of simplicial arrangements in the real projective plane
- Supersolvable reflection arrangements
- Crystallographic arrangements: Weyl groupoids and simplicial arrangements
- A Generalization of a Theorem of Sylvester on the Lines Determined by a Finite Point Set.
- The Lines and Planes Connecting the Points of a Finite Set
This page was built for publication: Supersolvable simplicial arrangements
