A bound for crystallographic arrangements

From MaRDI portal
Publication:1998936

DOI10.1016/J.JALGEBRA.2021.01.028zbMATH Open1462.20017arXiv1903.00300OpenAlexW3126577276MaRDI QIDQ1998936FDOQ1998936


Authors: Michael Cuntz Edit this on Wikidata


Publication date: 9 March 2021

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

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.


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




Recommendations




Cites Work


Cited In (5)





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)