Related papers: An introduction to diagram groups

For a finite group $G$, the proper power graph $\mathscr{P}^*(G)$ of $G$ is the graph whose vertices are non-trivial elements of $G$ and two vertices $u$ and $v$ are adjacent if and only if $u \neq v$ and $u^m=v$ or $v^m=u$ for some…

The cyclic graph $\Gamma(S)$ of a semigroup $S$ is the simple graph whose vertex set is $S$ and two vertices $x, y$ are adjacent if the subsemigroup generated by $x$ and $y$ is monogenic. In this paper, we classify the semigroup $S$ such…

Let G be the fundamental group of the complement of a K(G,1) hyperplane arrangement (such as Artin's pure braid group) or more generally a homologically toroidal group (as defined in the paper). The subgroup of elements in the complex…

In this paper, we construct a partial group \(\mathcal{P}(F)\) that represents the "partial symmetry" inherent in a subset \(F\) of \(d\)-dimensional Euclidean space. In cases where \(F\) is not connected, \(\mathcal{P}(F)\) captures more…

This paper is originally designed as a part of revision of the author's preprint math.AG/9908174 "P-adic Schwarzian triangle groups of Mumford type". Recently, Yves Andr'e pointed out a flaw in that preprint; more precisely, Proposition II…

This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…

In this paper, we apply the theory of algebraic cohomology to study the amenability of Thompson's group $\mathcal{F}$. We introduce the notion of unique factorization semigroup which contains Thompson's semigroup $\mathcal{S}$ and the free…

We develop the theory of semisimplifications of tensor categories defined by Barrett and Westbury. In particular, we compute the semisimplification of the category of representations of a finite group in characteristic $p$ in terms of…

In this article, we study the elements with disconnected centralizer in the Brauer complex associated to a simple algebraic group G defined over a finite field with corresponding Frobenius map F and derive the number of F-stable semisimple…

The undirected power graph (or simply power graph) of a group $G$, denoted by $P(G)$, is a graph whose vertices are the elements of the group $G$, in which two vertices $u$ and $v$ are adjacent if and only if either $u=v^m$ or $v=u^n$ for…

Version 2: Corrected Section 3.3: instead of lexicographical normal forms we now use a normal form due to V. Diekert and A. Muscholl. Consequent changes made and some misprints corrected. Using an analogue of Makanin-Razborov diagrams, we…

We introduce the subsemigroup complex of a finite semigroup S as a (boolean representable) simplicial complex defined through chains in the lattice of subsemigroups of S. We present a research program for such complexes, illustrated through…

Diagonal groups are one of the classes of finite primitive permutation groups occurring in the conclusion of the O'Nan-Scott theorem. Several of the other classes have been described as the automorphism groups of geometric or combinatorial…

A unitary representation of a, possibly infinite dimensional, Lie group G is called semi-bounded if the corresponding operators id\pi(x) from the derived representations are uniformly bounded from above on some non-empty open subset of the…

Let D be a connected graph. The Dynkin complex CD(A) of a D-algebra A was introduced by the second author in [TL2] to control the deformations of quasi-Coxeter algebra structures on A. In the present paper, we study the cohomology of this…

The (proper) power graph of a group is a graph whose vertex set is the set of all (nontrivial) elements of the group and two distinct vertices are adjacent if one is a power of the other. Various kinds of planarity of (proper) power graphs…

We classify and enumerate the idempotents in several planar diagram monoids: namely, the Motzkin, Jones (a.k.a. Temperley-Lieb) and Kauffman monoids. The classification is in terms of certain vertex- and edge-coloured graphs associated to…

Let ${\rm GK}(G)$ be the prime graph associated with a finite group $G$ and $D(G)$ be the degree pattern of $G$. A finite group $G$ is said to be $k$-fold OD-characterizable if there exist exactly $k$ non-isomorphic groups $H$ such that…

The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of $G$, they differ in exactly one vertex. Simplex graphs form…

We give formulae for the first homology of the $n$-braid group and the pure 2-braid group over a finite graph in terms of graph theoretic invariants. As immediate consequences, a graph is planar if and only if the first homology of the…