2000 character limit reached
On paired root systems of Coxeter groups
Published 17 Jan 2013 in math.RT and math.GR | (1301.3993v6)
Abstract: This paper examines a systematic method to construct a pair of (inter-related) root systems for arbitrary Coxeter groups from a class of non-standard geometric representations. This method can be employed to construct generalizations of root systems for a large family of groups generated only by involutions. We then give a characterization of Coxeter groups, among these groups, in terms of such paired root systems. Furthermore, we use this method to construct and study the paired root systems for reflection subgroups of Coxeter groups.
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.