2000 character limit reached
On rigidity of abstract root systems of Coxeter systems
Published 10 Nov 2010 in math.GR and math.RT | (1011.2270v1)
Abstract: We introduce and study a combinatorially defined notion of root basis of a (real) root system of a possibly infinite Coxeter group. Known results on conjugacy up to sign of root bases of certain irreducible finite rank real root systems are extended to abstract root bases, to a larger class of real root systems, and, with a short list of (genuine) exceptions, to infinite rank irreducible Coxeter systems.
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.