Related papers: Graph IRF Models and Fusion Rings
The construction of a family of real Hamiltonian forms (RHF) for the special class of affine 1+1-dimensional Toda field theories (ATFT) is reported. Thus the method, proposed in [1] for systems with finite number of degrees of freedom is…
We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such…
We remind how relationality arises as the core insight of general-relativistic gauge field theories from the articulation of the generalised hole and point-coincidence arguments. Hence, a compelling case for a manifestly relational…
In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…
Scott's graph model is a lambda-algebra based on the observation that continuous endofunctions on the lattice of sets of natural numbers can be represented via their graphs. A graph is a relation mapping finite sets of input values to…
For a diagram automorphism of an affine Kac-Moody algebra such that the folded diagram is still an affine Dynkin diagram, we show that the associated Drinfeld-Sokolov hierarchy also admits an induced automorphism. Then we show how to obtain…
We address the issue of the proximity of interacting diffusion models on large graphs with a uniform degree property and a corresponding mean field model, i.e. a model on the complete graph with a suitably renormalized interaction…
It is shown how exactly solved edge interaction models on the square lattice, may be extended onto more general planar graphs, with edges connecting a subset of next nearest neighbour vertices of $\mathbb{Z}^3$. This is done by using local…
We consider the restriction of interval exchange transformations to algebraic number fields, which leads to maps on lattices. We characterize renormalizability arithmetically, and study its relationships with a geometrical quantity that we…
A comprehensive symmetry resolution of the entanglement entropy (EE) in $(1+1)$-d rational conformal field theories (RCFT) with categorical non-invertible symmetries is presented. This amounts to symmetry resolving the entanglement with…
We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural…
In our recent paper we suggested a natural construction of the classical relativistic integrable tops in terms of the quantum $R$-matrices. Here we study the simplest case -- the 11-vertex $R$-matrix and related ${\rm gl}_2$ rational…
This is the second of a series of articles providing a foundation for the theory of Drinfeld modular forms of arbitrary rank. In the present part, we compare the analytic theory with the algebraic one that was begun in a paper of the third…
This survey provides a practical and algorithmic perspective on Drinfeld modules over $\mathbb F_q[T]$. Starting with the construction of the Carlitz module, we present Drinfeld modules in any rank and some of their arithmetic properties.…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
This work introduces a novel algorithm for finding the connected components of a graph where the vertices and edges are grouped into sets defining a Set--Based Graph. The algorithm, under certain restrictions on those sets, has the…
We study the relation between algebraic structures and Graph Theory. We have defined five different weighted digraphs associated to a finite dimensional algebra over a field in order to tackle important properties of the associated…
We consider the W-extended logarithmic minimal model WLM(p,p'). As in the rational minimal models, the so-called fundamental fusion algebra of WLM(p,p') is described by a simple graph fusion algebra. The fusion matrices in the regular…
Probabilistic graphical models provide a powerful tool to describe complex statistical structure, with many real-world applications in science and engineering from controlling robotic arms to understanding neuronal computations. A major…
Given an adaptable separated graph, we construct an associated groupoid and explore its type semigroup. Specifically, we first attach to each adaptable separated graph a corresponding semigroup, which we prove is an $E^*$-unitary inverse…