Related papers: Refinement monoids and adaptable separated graphs
Recently, a class of interaction round the face (IRF) solvable lattice models were introduced, based on any rational conformal field theory (RCFT). We investigate here the connection between the general solvable IRF models and the fusion…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
Monoids generated by elements of order two appear in numerous places in the literature. For example, Coxeter reflection groups in geometry, Kuratowski monoids in topology, various monoids generated by regular operations in language theory…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
Recently, Graph Neural Networks (GNNs) have greatly advanced the task of graph classification. Typically, we first build a unified GNN model with graphs in a given training set and then use this unified model to predict labels of all the…
The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…
We extend results from an earlier paper giving reconstruction results for the endomorphism monoid of the rational numbers under the strict and reflexive relations to the first order reducts of the rationals and the corresponding…
For any graph, one can construct a ring, called the edge ring, which is a quadratic-monomial generated subring of the Laurent polynomial ring $k[x_1^{\pm 1},\dots,x_n^{\pm 1}]$. In fact, every quadratic-monomial generated subring of this…
Let G be a finite group that acts on an abelian monoid A. If f: A -> G is a map so that f(a f(a)(b)) = f(a)f(b), for all a, b in A, then the submonoid S = {(a, f(a)) | a in A} of the associated semidirect product of A and G is said to be a…
Pretrained (language) embeddings are versatile, task-agnostic feature representations of entities, like words, that are central to many machine learning applications. These representations can be enriched through retrofitting, a class of…
We investigate refinement in the context of choreographies. We introduce refinable global choreographies allowing for the underspecification of protocols, whose interactions can be refined into actual protocols. Arbitrary refinements may…
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…
The de Rham complex arises naturally when studying problems in electromagnetism and fluid mechanics. Stable numerical methods to solve these problems can be obtained by using a discrete de Rham complex that preserves the structure of the…
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…
Let a $A$ be the 1-skeleton of a triangulated topological annulus. We establish bounds on the combinatorial modulus of a refinement $A'$, formed by attaching new vertices and edges to $A$, that depend only on the refinement and not on the…
Given a finite alphabet X and an ordering on the letters, the map \sigma sends each monomial on X to the word that is the ordered product of the letter powers in the monomial. Motivated by a question on Groebner bases, we characterize…
We give a new and self-contained proof of the finite generation of adjoint rings with big boundaries. As a consequence, we show that the canonical ring of a smooth projective variety is finitely generated.
In this paper, we propose a graph classification approach for automatically determining whether to use a monolithic or a decomposition-based solution method. In this approach, an optimization problem is represented as a graph that captures…
This paper develops a form of finite knot theory as a diagrammatic sequel to the ideal-stratum and deformation-persistence framework for knot types. Thick representatives in bounded ropelength sublevel spaces are studied through the finite…
The notion of augmenting graphs generalizes Berge's idea of augmenting chains, which was used by Edmonds in his celebrated solution of the maximum matching problem. This problem is a special case of the more general maximum independent set…