Related papers: Presentations of Groups with Even Length Relations

We find an explicit presentation of relative linear Steinberg groups $\mathrm{St}(n, R, I)$ for any ring $R$ and $n \geq 4$ by generators and relations as abstract groups. We also prove a similar result for relative simply laced Steinberg…

In this paper, we characterize the finite groups $G$ of even order with the property that for any involution $x$ and element $y$ of $G$, $\langle x, y \rangle$ is isomorphic to one of the following groups: $\mathbb{Z}_2,$ $\mathbb{Z}_2^2$,…

Let G be a reductive algebraic group over a field of prime characteristic. One can associate to G (or subgroups thereof) its Lie algebra, its Frobenius kernels, and the finite Chevalley group of points over a finite field. The…

We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…

Let F be a local henselian nonarchimedean field of residual field k, and let G be the group of F-points of a connected reductive group defined over F. It is well-known that the quotient of any parahoric subgroup of G by its first congruence…

We count factorizations of Singer cycles as products of reflections in the families of special and general unitary and linear groups over a finite field. In the case of minimum-length factorizations, the resulting answer is a striking…

Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…

We study when the adjacency matrix of a Cayley graph factors as the product of two adjacency matrices of Cayley graphs. Let $G$ be a finite group and let $U\subseteq G\setminus \{e\}$ be symmetric. Writing $A(G;U)$ for the adjacency matrix…

An isomorphism between the group ring of a finite group and a ring of certain block diagonal matrices is established. The group ring $RG$ of a finite group $G$ is isomorphic to the set of {\em group ring matrices} over $R$. It is shown that…

Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…

We prove a factorization-concentration result for characters of symmetric groups. This is then applied to the asymptotic behaviour of the decomposition of the tensor representations. There are connections with the Pastur-Marcenko…

We give a monoid presentation in terms of generators and defining relations for the partial analogue of the finite dual inverse symmetric monoid.

In this paper, we define and study a kind of Steinberg representation for linear algebraic groups of a particular kind, called groups of parahoric type, defined overa finite field; in particular, when G is the group of F-points of a…

We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an…

This note shows that if two elements of equal trace (e.g., conjugate elements) generate an arithmetic two-bridge knot or link group, then the elements are parabolic. This includes the figure-eight knot and Whitehead link groups. Similarly,…

We study commensurating actions of groups and the associated properties FW and PW, in connection with wallings, median graphs, CAT(0) cubings and multi-ended Schreier graphs.

Exponential Puiseux semirings are additive submonoids of $\qq_{\geq 0}$ generated by almost all of the nonnegative powers of a positive rational number, and they are natural generalizations of rational cyclic semirings. In this paper, we…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

In his initial paper on braids E.Artin gave a presentation with two generators for an arbitrary braid group. We give analogues of this Artin's presentation for various generalizations of braids.

We introduce shortcut graphs and groups. Shortcut graphs are graphs in which cycles cannot embed without metric distortion. Shortcut groups are groups which act properly and cocompactly on shortcut graphs. These notions unify a surprisingly…