Related papers: Redundant relators in cyclic presentations of grou…

For a connected graph L, let G(L) be a group with generators the vertex set of L, subject only to the relations that the ends of each edge commute. Now let H(L) be the kernel of the homomorphism from G(L) to the integers that takes each…

A cyclic order may be thought of informally as a way to seat people around a table, perhaps for a game of chance or for dinner. Given a set of agents such as $\{A,B,C\}$, we can formalize this by defining a cyclic order as a permutation or…

The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…

Real or complex tensor model observables, the backbone of the tensor theory space, are classical (unitary, orthogonal, symplectic) Lie group invariants. These observables represent as colored graphs, and that representation gives an handle…

Let G be a Lie group, $g = Lie(G)$ - its Lie algebra, $g*$ - the dual vector space and $\widehat G$ - the set of equivalence classes of unitary irreducible representations of $G$. The orbit method [1] establishes a correspondence between…

Several classes of irreducible orthogonal representations of compact Lie groups that are of importance in Differential Geometry have the property that the second osculating spaces of all of their nontrivial orbits coincide with the…

We give a necessary and sufficient condition on a visual splitting of an Artin group satisfying the conditions of two well known conjectures to be acylindrical, and demonstrate how this can be used to provide a large class of novel examples…

We investigate the groups of units of one-relator and special inverse monoids. These are inverse monoids which are defined by presentations where all the defining relations are of the form $r=1$. We develop new approaches for finding…

In this paper we complete the classification of topological symmetry groups for complete graphs $K_n$ by characterizing which $K_n$ can have a cyclic group, a dihedral group, or a subgroup of $D_m \times D_m$ where $m$ is odd, as its…

Given a finite group with a generating subset there is a well-established notion of length for a group element given in terms of its minimal length expression as a product of elements from the generating set. Recently, certain quantities…

This survey purports to be an elementary introduction to compactly presented groups, which are the analogue of finitely presented groups in the broader realm of locally compact groups. In particular, compact presentation is interpreted as a…

All nonabelian finite simple groups of rank $n$ over a field of size $q$, with the possible exception of the Ree groups $^2G_2(3^{2e+1})$, have presentations with at most $80 $ relations and bit-length $O(\log n +\log q)$. Moreover, $A_n$…

Let $G$ be a group. \textit{The permutability graph of cyclic subgroups of $G$}, denoted by $\Gamma_c(G)$, is a graph with all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\Gamma_c(G)$ are adjacent if and…

We go back and forth between, on the one hand, presentations of arithmetic and Kac-Moody groups and, on the other hand, presentations of profinite groups, deducing along the way new results on both.

Cyclic sieving is a well-known phenomenon where certain interesting polynomials, especially $q$-analogues, have useful interpretations related to actions and representations of the cyclic group. We propose a definition of sieving for an…

Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obtain a directed acyclic graph (DAG) with the same vertex set;…

For each family of finite classical groups, and their associated simple quotients, we provide an explicit presentation on a specific generating set of size at most 8. Since there exist efficient algorithms to construct this generating set…

We consider whether given a simple, finite description of a group in the form of an algorithm, it is possible to algorithmically determine if the corresponding group has some specified property or not. When there is such an algorithm, we…

Every nonabelian finite simple group of rank $n$ over a field of size $q$, with the possible exception of the Ree groups $^2G_2(3^{2e+1})$, has a presentation with a bounded number of generators and relations and total length $O(\log n…

This article deals with the study of cactus groups from a combinatorial point of view. These groups have been gaining prominence lately in various domains of mathematics, amongst which are their relations with well-known groups such as…