Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1110.3217

Groupoids, root systems and weak order I

Matthew Dyer
View original source ↗Read source document ↗Export metadata ↓

Abstract

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.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Matthew Dyer. 2011-10-14. Groupoids, root systems and weak order I. https://arxiv.org/abs/1110.3217

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR↗
arXiv2026

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR↗
arXiv2026

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR↗