Related papers: Representing finitely generated refinement monoids…
We develop a unified representation theory for the categories of finite subsets and relation-preserving maps of highly homogeneous relational structures classified by Cameron. For any commutative coefficient ring $k$, we extend the…
Arborescent knots are the ones which can be represented in terms of double fat graphs or equivalently as tree Feynman diagrams. This is the class of knots for which the present knowledge is enough for lifting topological description to the…
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 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…
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…
We provide an abstract categorical framework that relates the Cuntz semigroups of the C$^*$-algebras $A$ and $A\otimes \mathcal{K}$. This is done through a certain completion of ordered monoids by adding suprema of countable ascending…
We introduce a type of graph integrals which are holomorphic analogs of configuration space integrals. We prove their (ultraviolet) finiteness by considering a compactification of the moduli space of graphs with metrics, and study their…
We give an elementary characterization of those (abelian) semigroups $M$ that are direct limits of countable sequences of finite direct products of monoids of the form $C\cup\{0\}$ for monogenic groups $C$. This characterization involves…
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…
Graph-structured data appears frequently in domains including chemistry, natural language semantics, social networks, and knowledge bases. In this work, we study feature learning techniques for graph-structured inputs. Our starting point is…
This paper develops the fundamentals of modular representation theory for finite monoids, introducing the decomposition matrix and exploring its connection to Brauer characters. We define modular characteristic and explain how the…
We quantize the regularity properties of classical graphs that determine spin models for singly-generated Yang-Baxter planar algebras, including the Kauffman polynomial, and construct explicit examples. A source of examples comes from…
Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…
We investigate representations of mapping class groups of surfaces that arise from the untwisted Drinfeld double of a finite group G, focusing on surfaces without marked points or with one marked point. We obtain concrete descriptions of…
One introduces a class of projective parameterizations that resemble generalized de Jonqui\`eres maps. Any such parametrization defines a birational map $\mathfrak{F}$ of $\pp^n$ onto a hypersurface $V(F)\subset \pp^{n+1}$ with a strong…
We study relative Cohn path algebras, also known as Leavitt-Cohn path algebras, and we realize them as partial skew group rings (to do this we prove uniqueness theorems for relative Cohn path algebras). Furthermore, given any graph $E$ we…
Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…
The low-energy expansion of closed-string scattering amplitudes at genus one introduces infinite families of non-holomorphic modular forms called modular graph forms. Their differential and number-theoretic properties motivated Brown's…
This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…
Motivated by problems involving triangle-decompositions of graphs, we examine the facet structure of the cone $\tau_n$ of weighted graphs on $n$ vertices generated by triangles. Our results include enumeration of facets for small $n$, a…