Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Congruence Normality of Simplicial Hyperplane Arrangements via Oriented Matroids (2009.14152v2)

Published 29 Sep 2020 in math.CO and math.MG

Abstract: A catalogue of simplicial hyperplane arrangements was first given by Gr\"unbaum in 1971. These arrangements naturally generalize finite Coxeter arrangements and the weak order through the poset of regions. For simplicial arrangements, posets of regions are in fact lattices. We update Gr\"unbaum's catalogue, providing normals and invariants for all known sporadic simplicial arrangements with up to 37 lines. The weak order is known to be congruence normal, and congruence normality for simplicial arrangements can be determined using polyhedral cones called shards. In this article, we provide additional structure to the catalogue of simplicial hyperplane arrangements by determining which arrangements always/sometimes/never lead to congruence normal lattices of regions. To this end, we use oriented matroids to recast shards as covectors to determine congruence normality of large hyperplane arrangements. As a consequence of this approach we derive in particular which lattices of regions of sporadic simplicial arrangements of rank 3 are always congruence normal. We also show that lattices of regions from finite Weyl groupoids of any rank are congruence normal.

Summary

We haven't generated a summary for this paper yet.