Related papers: Linearity of Generalized Cactus Groups

A group, defined as set with associative multiplication and inverse, is a natural structure describing the symmetry of a space. The concept of group generalizes to group objects internal to other categories than sets. But there are yet more…

We explicitly construct an embedding of a right-angled Artin group into a classical pure braid group. Using this we obtain a number of corollaries describing embeddings of arbitrary Artin groups into right-angled Artin groups and linearly…

We introduce the notion of a Tits arrangement on a convex open cone as a special case of (infinite) simplicial arrangements. Such an object carries a simplicial structure similar to the geometric representation of Coxeter groups. The…

We study several enumeration problems connected to linear trees, a broad class which includes stars, paths, generalized stars, and caterpillars. We provide generating functions for counting the number of linear trees on $n$ vertices,…

Let V be a unitary space. Suppose G is a subgroup of the full symmetric group S_m and X is an irreducible unitary representation of G. In this paper, we introduce the generalized Cartesian symmetry class over V associated with G and X. Then…

We give a group-theoretic description of the parity of a pull-back of a theta characteristic under a branched covering. It involves lifting monodromy of the covering to the semidirect product of the symmetric and Clifford groups, known as…

We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…

We combinatorially characterize the number $\mathrm{cc}_2$ of conjugacy classes of involutions in any Coxeter group in terms of higher rank odd graphs. This notion naturally generalizes the concept of odd graphs, used previously to count…

We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…

We say that two elements of a group or semigroup are $\Bbbk$-linear conjugates if their images under any linear representation over $\Bbbk$ are conjugate matrices. In this paper we characterize $\Bbbk$-linear conjugacy for finite semigroups…

We give a quasi-isometric characterization of cacti, which is similar to Manning's characterization of quasi-trees by the bottleneck property. We also give another quasi-isometric characterization of cacti using fat theta curves.

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…

In the theory of crossed modules, considering arbitrary self-actions instead of conjugation allows for the extension of the concept of crossed modules and thus the notion of generalized crossed module emerges. In this paper we give a…

We consider groups $\mathbb{I}$ of isometries of ultrametric Urysohn spaces $\mathbb{U}$. Such spaces $\mathbb{U}$ admit transparent realizations as boundaries of certain $R$-trees and the groups $\mathbb{I}$ are groups of automorphisms of…

The cluster algebra of any acyclic quiver can be realized as the coordinate ring of a subvariety of a Kac-Moody group -- the quiver is an orientation of its Dynkin diagram, defining a Coxeter element and thereby a double Bruhat cell. We use…

We start by introducing the basics of configurations of points and lines, and then move into discussing symmetry groups of these configurations. Specifically, we explore how we might classify the symmetries of $(9_3)$ and $(10_3)$ geometric…

Given a group $G$ and a family of subgroups $\mathcal{F}$, we consider its classifying space $E_{\mathcal F}G$ with respect to $\mathcal{F}$. When $\mathcal F = \mathcal{VC}yc$ is the family of virtually cyclic subgroups, Juan-Pineda and…

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…

Recent results on the linearity of braid groups are extended in two ways. We generalize the Lawrence Krammer representation as well as Krammer's faithfulness proof for this linear representation to Artin groups of finite type.