Related papers: Refinement monoids and adaptable separated graphs
We characterize, in terms of elementary properties, the abelian monoids which are direct limits of finite direct sums of monoids of the form $(Z/nZ)\sqcup\{0\}$ (where 0 is a new zero element), for positive integers $n$. The key properties…
A graph vertex-subset problem defines which subsets of the vertices of an input graph are feasible solutions. We view a feasible solution as a set of tokens placed on the vertices of the graph. A reconfiguration variant of a vertex-subset…
Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly…
The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…
This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and…
Independent sets play a key role into the study of graphs and important problems arising in graph theory reduce to them. We define the monomial ideal of independent sets associated to a finite simple graph and describe its homological and…
Every countable graph can be built from finite graphs by a suitable infinite process, either adding new vertices randomly or imposing some rules on the new edges. On the other hand, a profinite topological graph is built as the inverse…
Our main theorem classifies the Auslander-Reiten triangles according to properties of the morphisms involved. As a consequence, we are able to compute the mapping cone of an irreducible morphism. We finish by showing a technique for…
We introduce and study a strong "thin triangle"' condition for directed graphs, which generalises the usual notion of hyperbolicity for a metric space. We prove that finitely generated left cancellative monoids whose right Cayley graphs…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
This paper continues the functional approach to the P-versus-NP problem, begun in [1]. Here we focus on the monoid RM_2^P of right-ideal morphisms of the free monoid, that have polynomial input balance and polynomial time-complexity. We…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
A rank 3 graph is an orbital graph of a rank 3 permutation group of even order. Despite the classification of rank 3 graphs being complete, see, e.g., Chapter 11 of the recent monograph 'Strongly regular graphs' by Brouwer and Van…
We define a covering of a profinite graph to be a projective limit of a system of covering maps of finite graphs. With this notion of covering, we develop a covering theory for profinite graphs which is in many ways analogous to the…
We deal with first-order definability in the substructure ordering $(\mathcal{D}; \sqsubseteq)$ of finite directed graphs. In two papers, the author has already investigated the first-order language of the embeddability ordering $(…
We prove that every $2d$-regular unimodular random network carries an invariant random Schreier decoration. Equivalently, it is the Schreier coset graph of an invariant random subgroup of the free group $F_d$. As a corollary we get that…
We study systems of combinatorial Dyson-Schwinger equations with an arbitrary number $N$ of coupling constants. The considered Hopf algebra of Feynman graphs is $\mathbb{N}^N$-graded, and we wonder if the graded subalgebra generated by the…
In this monograph we undertake a comprehensive study of separable representations (as well as their unitary equivalence classes) of $C^*$-algebras associated to strongly connected finite $k$-graphs $\Lambda$. We begin with the…
Recently there has been renewed interest in the mapping-class group of a compact surface of genus $g \ge 2$ and also in its finite order elements. A finite order element of the mapping-class group will be a conformal automorphisms on some…