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

We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with a family of algebraic laws, and might be useful for more general rewrite systems. These tools consist in introducing a…

Let $S$ be a semigroup and $T$ be a subsemigroup of finite index in $S$ (that is, the set $S\setminus T$ is finite). The subsemigroup $T$ is also called a large subsemigroup of $S$. It is well known that if $T$ has a finite complete…

A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$. Given a graph $G$ and $k \in \mathbb N$, the NP-hard Geodetic Set problem asks whether there is a geodetic set of size…

The enhanced power graph of a group is the simple graph whose vertex set is consisted of all elements of the group, and whose any pair of vertices are adjacent if they generate a cyclic subgroup. In this paper, we classify all finite groups…

We show that minimal length carrier graphs are not unique, but if M is in a large class of hyperbolic 3-manifolds, including the geometrically finite ones, then M has only finitely many minimal length carrier graphs and no two of them are…

In this paper we measure how efficiently a finite simple group $G$ is generated by its elements of order $p$, where $p$ is a fixed prime. This measure, known as the $p$-width of $G$, is the minimal $k\in \mathbb{N}$ such that any $g\in G$…

The congested clique model is a message-passing model of distributed computation where the underlying communication network is the complete graph of $n$ nodes. In this paper we consider the situation where the joint input to the nodes is an…

We prove that cocompact arithmetic lattices in a simple Lie group are uniformly discrete if and only if the Salem numbers are uniformly bounded away from $1$. We also prove an analogous result for semisimple Lie groups. Finally, we shed…

We give a uniform construction that, on input of a recursive presentation $P$ of a group, outputs a recursive presentation of a torsion-free group, isomorphic to $P$ whenever $P$ is itself torsion-free. We use this to re-obtain a known…

We use hypergeometric sheaves on $G_m/F_q$, which are particular sorts of rigid local systems, to construct explicit local systems whose arithmetic and geometric monodromy groups are the finite general linear groups $GL_n(q)$ for any $n \ge…

Graphlets are subgraphs rooted at a fixed vertex. The number of occurrences of graphlets aligned to a particular vertex, called graphlet degree sequence (gds), gives a topological description of the surrounding of the analyzed vertex.…

This paper initiates the study of circular orderability of $3$-manifold groups, motivated by the L-space conjecture. We show that a compact, connected, $\mathbb{P}^2$-irreducible $3$-manifold has a circularly orderable fundamental group if…

A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous deformations of the vertices arise from…

We study the geometry of a family of Lie groups, which contained the classical affine Lie groups, endowed with an exact left invariant symplectic form. We show that this family is closed by symplectic reduction and symplectic double…

We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be…

Let \(G\) be a finite group, and let \(\Delta(G)\) denote the \emph{prime graph} built on the set of degrees of the irreducible complex characters of \(G\). It is well known that, whenever \(\Delta(G)\) is connected, the diameter of…

This paper is a significant contribution to a general programme aimed to classify all projective irreducible representations of finite simple groups over an algebraically closed field, in which the image of at least one element is…

We study profinite actions of residually finite groups in terms of weak containment. We show that two strongly ergodic profinite actions of a group are weakly equivalent if and only if they are isomorphic. This allows us to construct…

We give an example of a monoid with finitely many left and right ideals, all of whose Schutzenberger groups are presentable by finite complete rewriting systems, and so each have finite derivation type, but such that the monoid itself does…

We prove that the class of residually C groups is closed under taking graph products, provided that C is closed under taking subgroups, finite direct products and that free-by-C groups are residually C. As a consequence, we show that local…