Skip to main navigation Skip to search Skip to main content

Congruence Normality of Simplicial Hyperplane Arrangements via Oriented Matroids

  • Leibniz University Hannover
  • Free University of Berlin

Research output: Contribution to journalJournal Articlepeer-review

4 Citations (Scopus)

Abstract

A catalogue of simplicial hyperplane arrangements was first given by Grünbaum in 1971. These arrangements naturally generalize finite Coxeter arrangements and also the weak order through the poset of regions. The weak order is known to be a congruence normal lattice, and congruence normality of lattices of regions of simplicial arrangements can be determined using polyhedral cones called shards. In this article, we update Grünbaum’s catalogue by providing normals realizing all known simplicial arrangements with up to 37 lines and key invariants. Then we add structure to this catalogue 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. We also show that lattices of regions coming from finite Weyl groupoids of any rank are always congruence normal.

Original languageEnglish
JournalAnnals of Combinatorics
Volume26
Issue number1
DOIs
Publication statusPublished - Mar 2022
Externally publishedYes

!!!Keywords

  • Congruence normality and uniformity
  • Covectors
  • Poset of regions
  • Shards
  • Simplicial hyperplane arrangements

Fingerprint

Dive into the research topics of 'Congruence Normality of Simplicial Hyperplane Arrangements via Oriented Matroids'. These topics are generated from the title and abstract of the publication. Together, they form a unique fingerprint.

Cite this