Related papers: Framed Blob Monoids
Starting from the geometric construction of the framed braid group, we define and study the framization of several Brauer-type monoids and also the set partition monoid, all of which appear in knot theory. We introduce the concept of…
We survey results devoted to the lattice of varieties of monoids. Along with known results, some unpublished results are given with proofs. A number of open questions and problems are also formulated.
We consider the classical problem of determining the largest possible cardinality of a minimal presentation of a numerical monoid with given embedding dimension and multiplicity. Very few values of this cardinality are known. In addressing…
Ramified monoids are a class of monoids introduced by the authors. The main motivation for considering these monoids comes from knot theory, see [3, 4, 5]. Thus, in [2] we have studied the ramified monoids of the symmeytric group and of the…
Combinatorial and topological aspects of monoids with an absorbing element and their associated algebras are considered. Phd thesis.
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
We introduce combinatorial objects named matricubes that provide a generalization of the theory of matroids. As matroids provide a combinatorial axiomatization of hyperplane arrangements, matricubes provide a combinatorial axiomatization of…
Factorizations of monoids are studied. Two necessary and sufficient conditions in terms of so-called descent 1-cocyles for a monoid to be factorized through two submonoids are found. A full classification of those factorizations of a monoid…
Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…
We give a closed formula for the graded decomposition numbers of the blob algebra over a field of characteristic zero at a root of unity.
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…
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…
We describe the structure of finite Boolean inverse monoids and apply our results to the representation theory of finite inverse semigroups. We then generalize to semisimple Boolean inverse semigroups.
In this paper we consider the monoids of all partial endomorphisms, of all partial weak endomorphisms, of all injective partial endomorphisms, of all partial strong endomorphisms and of all partial strong weak endomorphisms of a star graph…
In this paper we study the classification problem of convex lattice ploytopes with respect to given volume or given cardinality.
We give a finite axiomatization for the variety generated by relational, integral ordered monoids. As a corollary we get a finite axiomatization for the language interpretation as well.
We study modular ortholattices in the variety generated by the finite dimensional ones from an equational and geometric point of view. We relate this to coordinatization results.
We study polynomial functors over locally cartesian closed categories. After setting up the basic theory, we show how polynomial functors assemble into a double category, in fact a framed bicategory. We show that the free monad on a…
We initiate the combinatorial study of factorization systems on finite lattices, paying special attention to the role that reflective and coreflective factorization systems play in partitioning the poset of factorization systems on a fixed…
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…