Related papers: Combinatorics of affine cactus groups
We introduce a class of objects which we call 'affine surfaces'. These provide families of foliations on surfaces whose dynamics we are interested in. We present and analyze a couple of examples, and we define concepts related to these in…
We study the conjugacy classes of the classical affine groups. We derive generating functions for the number of classes analogous to formulas of Wall and the authors for the classical groups. We use these to get good upper bounds for the…
We prove a number of results about profinite completions of Coxeter groups. For example we prove Coxeter groups are good in the sense of Serre and that various splittings of Coxeter groups arising from actions on trees are detected by the…
A combinatorial group-theoretic hypothesis is presented that serves as a necessary and sufficient condition for a union of connected Cockcroft two-complexes to be Cockcroft. This hypothesis has a component that can be expressed in terms of…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
In this paper, we introduce and initiate the study of quandle products of groups, a family of groups that includes graph products of groups, cactus groups, wreath products, and the recently introduced trickle groups. Our approach is…
Shephard groups are common generalizations of Coxeter groups, Artin groups, and graph products of cyclic groups. Their definition is similar to that of a Coxeter group, but generators may have arbitrary order rather than strictly order 2.…
Wonderful compactifications of adjoint reductive groups over an algebraically closed field play an important role in algebraic geometry and representation theory. In this paper, we construct an equivariant compactification for adjoint…
This paper continues the study of cluster algebras initiated in math.RT/0104151. Its main result is the complete classification of the cluster algebras of finite type, i.e., those with finitely many clusters. This classification turns out…
In this paper, we study combinatorics of congruence subgroups of the modular group. More precisely, we consider the matrix equation that naturally arises in the theory of Coxeter friezes and investigate its irreducible solutions. We give…
In this article, we introduce rotation groups as a common generalisation of Coxeter groups and graph products of groups (including right-angled Artin groups). We characterise algebraically these groups by presentations (periagroups) and we…
Easy quantum groups are compact matrix quantum groups, whose intertwiner spaces are given by the combinatorics of categories of partitions. This class contains the symmetric group and the orthogonal group as well as Wang's quantum…
Brane systems provide a large class of gauge theories that arise in string theory. This paper demonstrates how such brane systems fit with a somewhat exotic geometric object, called the affine Grassmannian. This gives a strong motivation to…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…
We give a functorial definition of $G$-gerbes over a simplicial complex when the local symmetry group $G$ is non-Abelian. These combinatorial gerbes are naturally endowed with a connective structure and a curving. This allows us to define a…
We describe an algorithm to identify a minimal set of "braid relations" which span and preserve all sets of involution words for twisted Coxeter systems of finite or affine type. We classify the cases in which adding the smallest possible…
The cactus of a pointed graph is a discrete tree associated with this graph. Similarly, with every pointed geodesic metric space $E$, one can associate an $\R$-tree called the continuous cactus of $E$. We prove under general assumptions…
Combinatorial objects such as rooted trees that carry a recursive structure have found important applications recently in both mathematics and physics. We put such structures in an algebraic framework of operated semigroups. This framework…