A bound for crystallographic arrangements

Research output: Contribution to journalArticleResearchpeer review

View graph of relations

Details

Original languageEnglish
Pages (from-to)50-69
Number of pages20
JournalJournal of algebra
Volume574
Early online date2 Feb 2021
Publication statusPublished - 15 May 2021

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.

Keywords

    Reflection group, Simplicial arrangement, Weyl group, Weyl groupoid

ASJC Scopus subject areas

Cite this

A bound for crystallographic arrangements. / Cuntz, Michael.
In: Journal of algebra, Vol. 574, 15.05.2021, p. 50-69.

Research output: Contribution to journalArticleResearchpeer review

Cuntz M. A bound for crystallographic arrangements. Journal of algebra. 2021 May 15;574:50-69. Epub 2021 Feb 2. doi: 10.1016/j.jalgebra.2021.01.028
Download
@article{0c9a375ab83342b083384b09c4afd93f,
title = "A bound for crystallographic arrangements",
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. ",
keywords = "Reflection group, Simplicial arrangement, Weyl group, Weyl groupoid",
author = "Michael Cuntz",
year = "2021",
month = may,
day = "15",
doi = "10.1016/j.jalgebra.2021.01.028",
language = "English",
volume = "574",
pages = "50--69",
journal = "Journal of algebra",
issn = "0021-8693",
publisher = "Academic Press Inc.",

}

Download

TY - JOUR

T1 - A bound for crystallographic arrangements

AU - Cuntz, Michael

PY - 2021/5/15

Y1 - 2021/5/15

N2 - 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.

AB - 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.

KW - Reflection group

KW - Simplicial arrangement

KW - Weyl group

KW - Weyl groupoid

UR - http://www.scopus.com/inward/record.url?scp=85100250719&partnerID=8YFLogxK

U2 - 10.1016/j.jalgebra.2021.01.028

DO - 10.1016/j.jalgebra.2021.01.028

M3 - Article

VL - 574

SP - 50

EP - 69

JO - Journal of algebra

JF - Journal of algebra

SN - 0021-8693

ER -

By the same author(s)