Related papers: Combinatorics of affine cactus groups

This paper determines the relationship between the geometry of retractions and the combinatorics of folded galleries for arbitrary affine buildings, and so provides a unified framework to study orbits in affine flag varieties. We introduce…

We give several necessary and sufficient conditions for the existence of {\it the presentation by conjugation} for a non-simply laced extended affine Weyl group. We invent a computational tool by which one can determine simply the existence…

We give a unified solution to the conjugacy problem for Thompson's groups F, T, and V. The solution uses strand diagrams, which are similar in spirit to braids and generalize tree-pair diagrams for elements of Thompson's groups. Strand…

The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of…

We construct the scattering matrices for an arbitrary Weyl group in terms of elementary operators which obey the generalised Yang-Baxter equation. We use this construction to obtain the affine Hecke algebras. The center of the affine Hecke…

This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by…

We give a computational algorithm which decides if a braid is quasipositive or not. A braid is quasipositive if it's a product of conjuguates of generators. For this, we use the theory of Garside and the combinatorials properties of the…

A model for a finite group is a set of linear characters of subgroups that can be induced to obtain every irreducible character exactly once. A perfect model for a finite Coxeter group is a model in which the relevant subgroups are the…

We study group extensions of Finite Abelian Groups using matrices. We also prove a Theorem for equivalence of extensions using matrices.

We reduce a strong version of the twist conjecture for Artin groups to Artin groups whose defining graphs have no separating vertices. This produces new examples of Artin groups satisfying the conjecture, and sheds more light on the…

This paper classifies and constructs explicitly all the irreducible representations of affine Hecke algebras of rank two root systems. The methods used to obtain this classification are primarily combinatorial and are, for the most part, an…

This paper is about the combinatorics of finite point configurations in the tropical projective space or, dually, of arrangements of finitely many tropical hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be…

The geometric Satake correspondence provides an equivalence of categories between the Satake category of spherical perverse sheaves on the affine Grassmannian and the category of representations of the dual group. In this note, we define a…

We introduce classical and non-deterministic finite automata associated with representations of the braid group. After briefly reviewing basic definitions on finite automata, Coxeter's groups and the associated word problem, we turn to the…

We investigate a family of (reducible) representations of Artin's braid groups corresponding to a specific solution to the Yang-Baxter equation. The images of the braid groups under these representations are finite groups, and we identify…

We generalize the notion of a coloring complex of a graph to linearized combinatorial Hopf monoids. We determine when a linearized combinatorial Hopf monoid has such a construction, and discover some inequalities that are satisfied by the…

We introduce forest diagrams and strand diagrams for elements of Thompson's group F. A forest diagram is a pair of infinite, bounded binary forests together with an order-preserving bijection of the leaves. Using forest diagrams, we derive…

Recently, right-angled Artin groups have attracted much attention in geometric group theory. They have a rich structure of subgroups and nice algorithmic properties, and they give rise to cubical complexes with a variety of applications.…

We present a combinatorial analysis of fiber bundles of generalized configuration spaces on connected abelian Lie groups. These bundles are akin to those of Fadell-Neuwirth for configuration spaces, and their existence is detected by a…

Say that a finite group $G$ is mixable if a product of random elements, each chosen independently from two options, can distribute uniformly on $G$. We present conditions and obstructions to mixability. We show that $2$-groups, the…