Related papers: Rewriting Group Products with Transversals

It is shown that, under mild conditions, a complex reflection group $G(r,p,n)$ may be decomposed into a set-wise direct product of cyclic subgroups. This property is then used to extend the notion of major index and a corresponding Hilbert…

The representation theory for categorical groups is constructed. Each categorical group determines a monoidal bicategory of representations. Typically, these categories contain representations which are indecomposable but not irreducible. A…

For $i=1,\ldots,k$, let $\mathbf{G}_i$ be a connected, simply connected, semisimple algebraic group over some local field $\kappa_i$ of characteristic zero. Let $G_i=\mathbf{G}_i(\kappa_i)$ be the $\kappa_i$-points of $\mathbf{G}_i$ and…

We describe a simple scheme for constructing finitely generated monoids in which left-divisibility is a linear ordering and for practically investigating these monoids. The approach is based on subword reversing, a general method of…

In previous work we constructed twisted representations of mapping class groups of surfaces, depending on a choice of representation $V$ of the Heisenberg group $\mathcal{H}$. For certain $V$ we were able to untwist these mapping class…

For the second fundamental representation of the general linear group over a commutative ring $R$ we construct straightforward and uniform polynomial expressions of elementary generators as products of elementary conjugates of an arbitrary…

For an arbitrary commutative ring k and t in k, we construct a 2-functor S_t which sends a tensor category to a new tensor category. By applying it to the representation category of a bialgebra we obtain a family of categories which…

Let $A \leq G$ be a subgroup of a group $G$. An $A$-complement of $G$ is a subgroup $H$ of $G$ such that $G = A H$ and $A \cap H = \{1\}$. The \emph{classifying complements problem} asks for the description and classification of all…

We study a generalization Rec_d of the group IET=Rec_1 of interval exchange transformations in every dimension d>0, called the rectangle exchange transformations group. The subset of restricted rotations in IET is a generating subset and we…

Viewing Dehn's algorithm as a rewriting system, we generalise to allow an alphabet containing letters which do not necessarily represent group elements. This extends the class of groups for which the algorithm solves the word problem to…

Texts present coherent stories that have a particular theme or overall setting, for example science fiction or western. In this paper, we present a text generation method called {\it rewriting} that edits existing human-authored narratives…

We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its…

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

The hyperelliptic Torelli group is the subgroup of the mapping class group consisting of elements that act trivially on the homology of the surface and that also commute with some fixed hyperelliptic involution. The authors and Putman…

In this paper we prove some general theorems about representations of finite groups arising from the inner semidirect product of groups. We show how these results can be used for standard applications of group theory in quantum chemistry…

By a 2-group we mean a groupoid equipped with a weakened group structure. It is called split when it is equivalent to the semidirect product of a discrete 2-group and a one-object 2-group. By a permutation 2-group we mean the 2-group…

When ${\bf t} := \langle t_1,t_2,\ldots,t_k\rangle$ is a sequence of transpositions on the finite set $n:=\{0,1,\ldots,n-1\}$, then $\bigcirc{\bf t}:= t_1\circ t_2\circ\cdots\circ t_k$ denotes the compositional product of the sequence. Our…

We introduce Transformer Grammars (TGs), a novel class of Transformer language models that combine (i) the expressive power, scalability, and strong performance of Transformers and (ii) recursive syntactic compositions, which here are…

Let H be a connected reductive group over an algebraically closed field of characteristic zero, and let G be an abstract group. In this note we show that every homomorphism from the Grothendieck semiring of H to that of G which maps…

In this paper we study obstructions to presentability by products for finitely generated groups. Along the way we develop both the concept of acentral subgroups, and the relations between presentability by products on the one hand, and…