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

We explore transversals of finite index subgroups of finitely generated groups. We show that when $H$ is a subgroup of a rank $n$ group $G$ and $H$ has index at least $n$ in $G$ then we can construct a left transversal for $H$ which…

We present a complete rewriting system for twisted right-angled Artin groups. Utilizing the normal form coming from the rewriting system, we provide applications that illustrate differences and similarities with right-angled Artin groups,…

There is a graph reduction system so that every optimal 1-planar graph can be reduced to an irreducible extended wheel graph, provided the reductions are applied such that the given graph class is preserved. A graph is optimal 1-planar if…

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…

We study the zero-sharing behavior among irreducible characters of a finite group. For symmetric groups $S_n$, it is proved that, with one exception, any two irreducible characters have at least one common zero. To further explore this…

The basic principle of graph rewriting is the stepwise replacement of subgraphs inside a host graph. A challenge in such replacement steps is the treatment of the patch graph, consisting of those edges of the host graph that touch the…

We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by…

We prove that a complete bipartite graph can be decomposed into cycles of arbitrary specified lengths provided that the obvious necessary conditions are satisfied, the length of each cycle is at most the size of the smallest part, and the…

Deduction systems and graph rewriting systems are compared within a common categorical framework. This leads to an improved deduction method in diagrammatic logics.

Convergent rewriting systems on algebraic structures give methods to solve decision problems, to prove coherence results, and to compute homological invariants. These methods are based on higher-dimensional extensions of the critical…

We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.

An embedding of a graph into $\mathbb{R}^3$ is said to be linear, if any edge of the graph is sent to be a line segment. And we say that an embedding $f$ of a graph $G$ into $\mathbb{R}^3$ is free, if $\pi_1(\mathbb{R}^3-f(G))$ is a free…

The several algebraic approaches to graph transformation proposed in the literature all ensure that if an item is preserved by a rule, so are its connections with the context graph where it is embedded. But there are applications in which…

We consider 3-regular planar matchstick graphs, i.e. those which have a planar embedding such that all edge lengths are equal, with given girth g. For girth 3 it is known that such graphs exist if and only if the number of vertices n is an…

Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…

We prove that if an infinite, discrete semigroup has the property that every right syndetic set is left syndetic, then the semigroup has a left invariant mean. We prove that the weak*-closed convex hull of the two-sided translates of every…

Let $G$ be a group of permutations acting on an $n$-vertex set $V$, and $X$ and $Y$ be two simple graphs on $V$. We say that $X$ and $Y$ are $G$-isomorphic if $Y$ belongs to the orbit of $X$ under the action of $G$. One can naturally…

We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of…

In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…

We prove that, for every integer $n \ge 2$, a finite or infinite countable group $G$ can be embedded into a 2-generated group $H$ in such a way that the solvability of quadratic equations of length at most $n$ is preserved, i.e., every…