2000 character limit reached
On simply-laced generalized root systems
Published 25 Mar 2016 in math.AG and math.RT | (1603.07821v1)
Abstract: We show the uniqueness and existence of the Euler form for a simply-laced generalized root system. This enables us to show that the Coxeter element for a simply-laced generalized root system is admissible in the sense of R.~W.~Carter. As an application, the isomorphism classes of simply-laced generalized root systems with positive definite Cartan forms are classified by Cartar's admissible diagrams associated to their Coxeter elements.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.