Related papers: Refinement monoids and adaptable separated graphs
We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids…
Fix an ordinary abelian variety defined over a finite field. The ideal class group of its endomorphism ring acts freely on the set of isogenous varieties with same endomorphism ring, by complex multiplication. Any subgroup of the class…
The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$ is the graph whose vertices correspond to the $i(G)$-sets, and where two…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
A survey of enumeration problems arising from the study of graphs formed when the edges of a polygon are marked with evenly spaced points and every pair of points is joined by a line. A few of these problems have been solved, a classical…
We introduce two monads on the category of graphs and prove that their Eilenberg-Moore categories are isomorphic to the category of perfect matchings and the category of partial Steiner triple systems, respectively. As a simple application…
We extend Grood's tableau construction of irreducible representations of the rook monoid and Steinberg's analogous result for the full transformation monoid. Our approach is characteristic-free and applies to any submonoid $\mathcal{M}(n)$…
We study various aspects of the structure and representation theory of singular Artin monoids. This includes a number of generalizations of the desingularization map and explicit presentations for certain finite quotient monoids of…
Using functional derivatives with respect to the free correlation function we derive a closed set of Schwinger-Dyson equations in phi^4-theory. Its conversion to graphical recursion relations allows us to systematically generate all…
A graph class $\mathscr{C}$ is called monadically stable if one cannot interpret, in first-order logic, arbitrary large linear orders in colored graphs from $\mathscr{C}$. We prove that the model checking problem for first-order logic is…
Every $F$-inverse monoid can be equipped with the unary operation which maps each element to the maximum element of its $\sigma$-class. In this enriched signature, the class of all $F$-inverse monoids forms a variety of algebraic…
In this technical report we describe a general class of monoids for which (sub)sequential rational can be characterised in terms of a congruence relation in the flavour of Myhill-Nerode relation. The class of monoids that we consider can be…
In this paper, we consider certain elements in von Neumann algebras generated by graph groupoids. In particular, we are interested in finitely supported elements, called graph operators. We study the characterizations for self-adjointness,…
Suppose that $F$ is a finite field and $R=M_n(F)$ is the ring of $n$-square matrices over $F$. Here we characterize when the Cayley graph of the additive group of $R$ with respect to the set of invertible elements of $R$, called the unitary…
A functor of sets $\mathbb X$ over the category of $K$-commutative algebras is said to be an affine functor if its functor of functions, $\mathbb A_{\mathbb X}$, is reflexive and $\mathbb X=\Spec \mathbb A_{\mathbb X}$. We prove that affine…
Let $\mathcal G$ denote the space of finitely generated marked groups. For any finitely generated group $G$, we construct a continuous, injective map $f$ from the space of subgroups $Sub(G)$ to $\mathcal G$ that sends conjugate subgroups to…
The problem of computing all maximal induced subgraphs of a graph G that have a graph property P, also called the maximal P-subgraphs problem, is considered. This problem is studied for hereditary, connected-hereditary and rooted-hereditary…
We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…
We use the theory of group actions on profinite trees to prove that the fundamental group of a finite, 1-acylindrical graph of free groups with finitely generated edge groups is conjugacy separable. This has several applications: we prove…
We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…