A bound for crystallographic arrangements

DOI10.1016/J.JALGEBRA.2021.01.028MaRDI QIDQ1998936zbMATH OpenOpenAlexFDO

Authors Michael Cuntz

Publication date 9 March 2021

Published in Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

Weyl groupreflection groupWeyl groupoidsimplicial arrangement

Mathematics Subject Classification ID

Reflection and Coxeter groups (group-theoretic aspects) (20F55) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Configurations and arrangements of linear subspaces (14N20)

Abstract: A crystallographic arrangement is a set of linear hyperplanes satisfying a certain integrality property and decomposing the space into simplicial cones. Crystallographic arrangements were completely classified in a series of papers by Heckenberger and the author. However, this classification is based on two computer proofs checking millions of cases. In the present paper, we prove without using a computer that, up to equivalence, there are only finitely many irreducible crystallographic arrangements in each rank greater than two.

Recommendations

• Crystallographic arrangements: Weyl groupoids and simplicial arrangements.
• Coxeter and crystallographic arrangements are inductively free
• Irreducible circuits and Coxeter arrangements
• Finite Weyl groupoids
• Supersolvable simplicial arrangements

Cites work

• scientific article; zbMATH DE number 52944 (Why is no real title available?)
• A catalogue of simplicial arrangements in the real projective plane
• A classification of Nichols algebras of semisimple Yetter-Drinfeld modules over non-abelian groups
• Crystallographic arrangements: Weyl groupoids and simplicial arrangements.
• Finite Weyl groupoids
• Finite Weyl groupoids of rank three.
• Frieze patterns as root posets and affine triangulations
• Les immeubles des groupes de tresses généralises
• Reflection groupoids of rank two and cluster algebras of type \(A\)
• Simplicial arrangements on convex cones
• Simplicial arrangements with up to 27 lines
• Strongly symmetric smooth toric varieties
• Supersolvable simplicial arrangements
• The Nichols algebra of a semisimple Yetter-Drinfeld module.
• The Weyl groupoid of a Nichols algebra of diagonal type
• Weyl groupoids of rank two and continued fractions.
• Weyl groupoids with at most three objects.

Cited in

(5)

• Crystal pop-stack sorting and type \(A\) crystal lattices
• A crystal theoretic method for finding rigged configurations from paths
• Crystalline boundedness principle
• A classification of generalized root systems
• On a family of hyperplane arrangements related to the affine Weyl groups

This page was built for publication: A bound for crystallographic arrangements

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