Related papers: The Geometry of Special Monoids

Four geometric conditions on a geodesic metric space, which are stronger variants of classical conditions characterizing hyperbolicity, are proved to be equivalent. In the particular case of the Cayley graph of a finitely generated group,…

We study the class of monoids that arise as the submonoid of right units of finitely presented special inverse monoids (SIMs). Gray and Ru\v{s}kuc (2024) gave the first example of a finitely presented SIM whose submonoid of right units does…

Let $\Gamma$ be a simple graph on a finite vertex set $V$ and let $A$ be its adjacency matrix. Then $\Gamma$ is said to be singular if and only if $0$ is an eigenvalue of $A.$ The nullity (singularity) of $\Gamma,$ denoted by ${\rm…

In this article we investigate a monoid of smooth mappings on the space of arrows of a Lie groupoid and its group of units. The group of units turns out to be an infinite-dimensional Lie group which is regular in the sense of Milnor.…

We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…

Let $G$ be a regular graph of degree $d$ and let $A\subset V(G)$. Say that $A$ is $\eta$-closed if the average degree of the subgraph induced by $A$ is at least $\eta d$. This says that if we choose a random vertex $x\in A$ and a random…

In this paper we investigate properties of the Artin monoid Cayley graph. This is the Cayley graph of an Artin group $A_\Gamma$ with respect to the (infinite) generating set given by the associated Artin monoid $A^+_\Gamma$. In a previous…

We show that the category of $X$-generated $E$-unitary inverse monoids with greatest group image $G$ is equivalent to the category of $G$-invariant, finitary closure operators on the set of connected subgraphs of the Cayley graph of $G$.…

A subset $C$ of the vertex set of a graph $\Gamma$ is called a perfect code in $\Gamma$ if every vertex of $\Gamma$ is at distance no more than $1$ to exactly one vertex of $C$. A subset $C$ of a group $G$ is called a perfect code of $G$ if…

A perfect code $C$ in a graph $\Gamma$ is an independent set of vertices of $\Gamma$ such that every vertex outside of $C$ is adjacent to a unique vertex in $C$, and a total perfect code $C$ in $\Gamma$ is a set of vertices of $\Gamma$ such…

There is a tight relation between the geometry of a directed graph and the algebraic structure of a Leavitt path algebra associated to it. In this note, we show a similar connection between the geometry of the graph and the structure of a…

The Sylow graph $\Gamma(G)$ of a finite group $G$ originated from recent investigations on the so--called $\mathbf{N}$--closed classes of groups. The connectivity of $\Gamma(G)$ was proved only few years ago, involving the classification of…

We study groups acting by length-preserving transformations on spaces equipped with asymmetric, partially-defined distance functions. We introduce a natural notion of quasi-isometry for such spaces and exhibit an extension of the…

A perfect code in a graph $\Gamma$ is a subset $C$ of $V(\Gamma)$ such that no two vertices in $C$ are adjacent and every vertex in $V(\Gamma)\setminus C$ is adjacent to exactly one vertex in $C$. Let $G$ be a finite group and $C$ a subset…

We study two notions of being well-structured for classes of graphs that are inspired by classic model theory. A class of graphs $C$ is monadically stable if it is impossible to define arbitrarily long linear orders in vertex-colored graphs…

The set \[ \Gamma {\stackrel{\rm def}{=}} \{(z+w,zw):|z|\leq 1,|w|\leq 1\} \subset {\mathbb{C}}^2 \] has intriguing complex-geometric properties; it has a 3-parameter group of automorphisms, its distinguished boundary is a ruled surface…

We present a Myhill-Nerode theorem for hypergraphs. The theorem involves an operation which takes two input structures and produces a hypergraph as output. Using this operation, we define a Myhill-Nerode-type equivalence relation and show…

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…

We give a new characterisation of virtually free groups using graph minors. Namely, we prove that a finitely generated, infinite group is virtually free if and only if for any finite generating set, the corresponding Cayley graph is minor…

It is shown that a flat subgroup, $H$, of the totally disconnected, locally compact group $G$ decomposes into a finite number of subsemigroups on which the scale function is multiplicative. The image, $P$, of a multiplicative semigroup in…