Related papers: Refinement monoids and adaptable separated graphs
We describe the automorphism groups of reductive monoids and of root monoids with active groups of invertible elements.
We define basic notions in the category of conic representations of a topological group and prove elementary facts about them. We show that a conic representation determines an ordinary dynamical system of the group together with a…
We present the first combinatorial scheme for counting labelled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function of labelled 4-regular planar graphs can be…
We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…
With an arbitrary finite graph having a special form of 2-intervals (a diamond-shaped graph) we associate a subgroup of a symmetric group and a representation of this subgroup; state a series of problems on such groups and their…
We generalize the notion of a coloring complex of a graph to linearized combinatorial Hopf monoids. We determine when a linearized combinatorial Hopf monoid has such a construction, and discover some inequalities that are satisfied by the…
Ribbon graphs embedded on a Riemann surface provide a useful way to describe the double line Feynman diagrams of large N computations and a variety of other QFT correlator and scattering amplitude calculations, e.g in MHV rules for…
Differential modules over a commutative differential ring R which are finitely generated projective as ring modules, with differential homomorphisms, form an additive category, so their isomorphism classes form a monoid. We study the…
For affine symmetric groups we construct finite $W$-graphs corresponding to two-row shapes, and prove their uniqueness. This gives the first non-trivial family of examples of finite $W$-graphs in an affine type. We compare our construction…
For a finite connected graph $\mathcal{E}$ with set of edges $E$, a finite $E$-generated group $G$ is constructed such that the set of relations $p=1$ satisfied by $G$ (with $p$ a word over $E\cup E^{-1}$) is closed under deletion of…
A monoid is said to be special if it admits a presentation in which all defining relations are of the form $w = 1$. Groups are familiar examples of special monoids. This article studies the geometric and structural properties of the Cayley…
Refined algebraic domains are regions in the plane surrounded by finitely many non-singular real algebraic curves which may intersect with normal crossing. We are interested in shapes of such regions with surrounding real algebraic curves.…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…
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$.…
I extend the definitions of schemes relative to monoids with zero - and therefore, toric geometry - to the world of formal schemes. This expands the usual framework to include, for instance, models for Mumford's degenerating Abelian…
In this note we prove that any affine algebraic monoid can be obtained as the endomorphisms' monoid of a finite-dimensional (nonassociative) algebra.
A finitely generated commutative monoid is uniquely presented if it has only a minimal presentation. We give necessary and sufficient conditions for finitely generated, combinatorially finite, cancellative, commutative monoids to be…
We define refined invariants which "count" nodal curves in sufficiently ample linear systems on surfaces, conjecture that their generating function is multiplicative, and conjecture explicit formulas in the case of K3 and abelian surfaces.…
A partial automorphism of a finite graph is an isomorphism between its vertex induced subgraphs. The set of all partial automorphisms of a given finite graph forms an inverse monoid under composition (of partial maps). We describe the…
We give a complete description of the congruence lattices of the following finite diagram monoids: the partition monoid, the planar partition monoid, the Brauer monoid, the Jones monoid (also known as the Temperley-Lieb monoid), the Motzkin…