Related papers: Rewriting systems, plain groups, and geodetic grap…

In this note, we show that among finite nilpotent groups of a given order or finite groups of a given odd order, the cyclic group of that order has the minimum number of edges in its cyclic subgroup graph. We also conjecture that this holds…

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

In order to define graph transformations by the simultaneous application of concurrent rules, we have adopted in previous work a structure of attributed graphs stable by unions. We analyze the consequences on parallel independence, a…

For a finite group $G$ and for a fixed positive integer $k$, $k\geq 2$, the $k$-power graph of $G$ is an undirected simple graph with vertex set $G$ in which two distinct vertices $x$ and $y$ are adjacent if and only if $x^k=y$ or $y^k=x$.…

The genus spectrum of a finite group $G$ is the set of all $g\geq 2$ such that $G$ acts faithfully and orientation-preserving on a closed compact orientable surface of genus $g$. This article is an overview of some results relating the…

A reduction $\varphi$ of an ordered group $(G,P)$ to another ordered group is an order homomorphism which maps each interval $[1,p]$ bijectively onto $[1, \varphi(p)]$. We show that if $(G,P)$ is weakly quasi-lattice ordered and reduces to…

Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…

The codegree of an irreducible character $\chi$ of a finite group $G$ is defined as $|G:\ker\chi|/\chi(1)$. The codegree graph $\Gamma(G)$ of a finite group $G$ is the graph whose vertices are the prime divisors of $|G|$, where two distinct…

The existence of an infinite simple boundedly generated 2-generated group and the existence of a boundedly simple 2-generated group containing a free non-cyclic subgroup are proved.

In this paper we establish combinatorial characterisations of symmetry-generic infinitesimally rigid frameworks in the Euclidean plane for rotational groups of order 4 and 6, and of odd order between 5 and 1000, where a joint may lie at the…

The enhanced power graph, $\mathcal{E}(G)$, of a group $G$ has vertex set $G$ and two elements are adjacent if they generate a cyclic subgroup. In the case of finite groups, we identify some striking and unexpected properties of these…

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

We show that if a group can be represented as a graph product of finite directly indecomposable groups, then this representation is unique.

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…

We establish vanishing results for limits of characters in various discrete groups, most notably irreducible lattices in higher rank semisimple Lie groups. As an application, we show that any sequence of finite-dimensional representations…

We prove a conjecture made by Gilman in 1984 that the groups presented by finite, monadic, confluent rewriting systems are precisely the free products of free and finite groups.

In this paper we study the elementary theory of graph products of groups and show that under natural conditions on the vertex groups we can recover (the core of) the underlying graph and the associated vertex groups. More precisely, we…

An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…

In this paper, we study the structures of finite groups using some arithmetic conditions on the sizes of real conjugacy classes. We prove that a finite group is solvable if the prime graph on the real class sizes of the group is…

For a finite simplicial graph $\Gamma$, let $G(\Gamma)$ denote the right-angled Artin group on the complement graph of $\Gamma$. In this article, we introduce the notions of "induced path lifting property" and "semi-induced path lifting…