2000 character limit reached
Crystallographic arrangements: Weyl groupoids and simplicial arrangements
Published 10 Jun 2010 in math.QA and math.CO | (1006.1997v1)
Abstract: We introduce the simple notion of a "crystallographic arrangement" and prove a one-to-one correspondence between these arrangements and the connected simply connected Cartan schemes for which the real roots are a finite root system (up to equivalence on both sides). We thus obtain a more accessible definition for this very large subclass of the class of simplicial arrangements for which a complete classification is known.
Paper Prompts
Sign up for free to create and run prompts on this paper.