Related papers: From modular invariants to graphs: the modular spl…
This paper introduces the foliage partition, an easy-to-compute LC-invariant for graph states, of computational complexity $\mathcal{O}(n^3)$ in the number of qubits. Inspired by the foliage of a graph, our invariant has a natural graphical…
We demonstrate that the Ising model on a general triangular graph with 3 distinct couplings $K_1,K_2,K_3$ corresponds to an affine transformed conformal field theory (CFT). Full conformal invariance of the $c= 1/2$ minimal CFT is restored…
Following the initial proposal in 1988, there has been much progress in classifying Rational Conformal Field Theories in 2 dimensions from the Holomorphic Bootstrap approach. This method starts by postulating a generic holomorphic Modular…
We complete the realisation by braided subfactors, announced by Ocneanu, of all SU(3)-modular invariant partition functions previously classified by Gannon.
There are operations that transform a map M (an embedding of a graph on a surface) into another map in the same surface, modifying its structure and consequently its set of flags F(M). For instance, by truncating all the vertices of a map…
Associated to a graph $G$ is a set $\mathcal{S}(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be…
We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…
By using Ocneanu's result on the classification of all irreducible connections on the Dynkin diagrams, we show that the dual principal graphs as well as the fusion rules of bimodules arising from any Goodman-de la Harpe-Jones subfactors are…
We associate a moduli problem to a colored trivalent graph; such graphs, when planar, appear in the state-sum description of the quantum sl(N) knot polynomial due to Murakami, Ohtsuki, and Yamada. We discuss how the resulting moduli space…
Graph partitioning, or the dividing of a graph into two or more parts based on certain conditions, arises naturally throughout discrete mathematics, and problems of this kind have been studied extensively. In the 1990s, Ando conjectured…
A novel invariant decomposition of diagonalizable $n \times n$ matrices into $n$ commuting matrices is presented. This decomposition is subsequently used to split the fundamental representation of $\mathfrak{su}(3)$ Lie algebra elements…
In this note we consider the question how the set of inversions of a permutation $\pi \in S_n$ can be partitioned into two subset, such that those are itself inversion sets of permutations. This is archived by exploiting a connection to a…
We present a quasi-linearly scaling, first order polynomial finite element method for the solution of the magnetostatic open boundary problem by splitting the magnetic scalar potential. The potential is determined by solving a Dirichlet…
The Fast Fourier Transform is extended to functions on finite graphs whose edges are identified with intervals of finite length. Spectral and pseudospectral methods are developed to solve a wide variety of time dependent partial…
The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important…
Determinantal ideals of graphs generalize, among others, the spectrum and the Smith normal form (SNF) of integer matrices associated to graphs. In this work we investigate the relationship of the spectrum and the SNF with the determinantal…
Splitting invariants describe how a plane curve "splits" by the pull-back under a Galois cover over the projective plane whose branch locus contains no component of the plane curve. They enable us to distinguish the embedded topology of…
It is known that problems like Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal are polynomial time solvable in the class of chordal graphs. We consider these problems in a graph that has at most $k$ vertices whose deletion…
The Kac-Ward formula allows to compute the Ising partition function on a planar graph G with straight edges from the determinant of a matrix of size 2N, where N denotes the number of edges of G. In this paper, we extend this formula to any…
Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a single vertex. This notion of exactitude of neighbourhood is very…