A bound for crystallographic arrangements (Q1998936)

From MaRDI portal





scientific article
Language Label Description Also known as
default for all languages
No label defined
    English
    A bound for crystallographic arrangements
    scientific article

      Statements

      A bound for crystallographic arrangements (English)
      0 references
      0 references
      9 March 2021
      0 references
      The author proves without using a computer that, up to equivalence, there are only finitely many irreducible crystallographic arrangements in each rank greater than two. The proof proceeds establishing a bound for the sizes of localizations of rank two. Using the volume function on roots yields a global bound for these volumes. The main result is obtained using the pigeonhole principle.
      0 references
      simplicial arrangement
      0 references
      reflection group
      0 references
      Weyl group
      0 references
      Weyl groupoid
      0 references

      Identifiers