Related papers: Groupoids, root systems and weak order I

Motivated by work of Kac and Lusztig, we define a root system and a Weyl groupoid for a large class of semisimple Yetter-Drinfeld modules over an arbitrary Hopf algebra. The obtained combinatorial structure fits perfectly into an existing…

This paper investigates the question of uniqueness of the reduced oriented matroid structure arising from root systems of a Coxeter group in real vector spaces. We settle the question for finite Coxeter groups, irreducible affine Weyl…

The notion of limit roots of a Coxeter group W was recently introduced (see arXiv:1112.5415 and arXiv:1303.6710): they are the accumulation points of directions of roots of a root system for W. In the case where the root system lives in a…

We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…

Coxeter groups are equipped with a partial order known as the weak order, such that $u \leq v$ if the inversions of $u$ are a subset of the inversions of $v$. In finite Coxeter groups, weak order is a complete lattice, but in infinite…

Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…

We survey several notions of Mackey functors and biset functors found in the literature and prove some old and new theorems comparing them. While little here will surprise the experts, we draw a conceptual and unified picture by making…

In this article, we investigate the existence of joins in the weak order of an infinite Coxeter group W. We give a geometric characterization of the existence of a join for a subset X in W in terms of the inversion sets of its elements and…

The super Weyl group of a basic classical Lie superalgebra was introduced and studied in \cite{PS}, which turns out to play an important role for the study of representations of the basic classical Lie superalgebras and algebraic…

If $x$ and $y$ are roots in the root system with respect to the standard (Tits) geometric realization of a Coxeter group $W$, we say that $x$ \emph{dominates} $y$ if for all $w\in W$, $wy$ is a negative root whenever $wx$ is a negative…

The aim of this paper is to explain, mostly through examples, what groupoids are and how they describe symmetry. We will begin with elementary examples, with discrete symmetry, and end with examples in the differentiable setting which…

The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…

In this paper we study affine reflection subgroups in arbitrary infinite Coxeter groups of finite rank. In particular, we study the distribution of roots of Coxeter groups in the root subsystems associated with affine reflection subgroups.…

In this paper, we show that via a novel construction every rank-3 root system induces a root system of rank 4. Via the Cartan-Dieudonn\'e theorem, an even number of successive Coxeter reflections yields rotations that in a Clifford algebra…

This expository article introduces the topic of roots in a compact Lie group. Compared to the many other treatments of this standard topic, I intended for mine to be relatively elementary, example-driven, and free of unnecessary…

In this article we introduce the notion of a \textit{regular partition} of a Coxeter group. We develop the theory of these partitions, and show that the class of regular partitions is essentially equivalent to the class of automata (not…

Given any Coxeter group, we define rigid reflections and rigid roots using non-self-intersecting curves on a Riemann surface with labeled curves. When the Coxeter group arises from an acyclic quiver, they are related to the rigid…

The weak order is a classical poset structure on a Coxeter group; it is a lattice when the group is finite but merely a meet-semilattice when the group is infinite. Motivated by problems in Kazhdan--Lusztig theory, Matthew Dyer introduced…

We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…

The main purpose of this paper is to study the vector groupoids. This is an algebraic structure which combines the concepts of Brandt groupoid and vector space such that these are compatible.