arXiv Analytics

Sign in

arXiv:1110.3217 [math.GR]AbstractReferencesReviewsResources

Groupoids, root systems and weak order I

Matthew Dyer

Published 2011-10-14Version 1

This is the first of a series of papers which define and study structures called rootoids, which are groupoids equipped with a representation in the category of Boolean rings and with an associated 1-cocycle. The axioms for rootoids are abstracted from formal properties of Coxeter groups with their root systems and weak orders. They imply that each of the weak orders of a rootoid embeds as an order ideal in a complete ortholattice. This first paper is concerned only with the most basic definitions, facts and examples; the main results, which are new even for Coxeter groups, will be stated and proved in subsequent papers. They involve certain categories of rootoids and especially a notion of functor rootoid.

Comments: 47 pages
Categories: math.GR
Subjects: 20F55, 17B22, 20L05, 06A12, 20J99
Related articles: Most relevant | Search more
arXiv:1505.02058 [math.GR] (Published 2015-05-08)
Small roots, low elements, and the weak order in Coxeter groups
arXiv:1108.5557 [math.GR] (Published 2011-08-29)
On the weak order of Coxeter groups
arXiv:2212.14767 [math.GR] (Published 2022-12-30)
A Note on Centralizers of Involutions in Coxeter Groups