Graph Calculus and the Disconnected-Boundary Schwinger-Dyson Equations of Quartic Tensor Field Theories

Tensor field theory (TFT) focuses on quantum field theory aspects of random tensor models, a quantum-gravity-motivated generalisation of random matrix models. The TFT correlation functions have been shown to be classified by graphs that describe the geometry of the boundary states, the so-called boundary graphs. These graphs can be disconnected, although the correlation functions are themselves connected. In a recent work, the Schwinger-Dyson equations for an arbitrary albeit connected boundary were obtained. Here, we introduce the multivariable graph calculus in order to derive the missing equations for all correlation functions with disconnected boundary, thus completing the Schwinger-Dyson pyramid for quartic melonic (‘pillow’-vertices) models in arbitrary rank. We first study finite group actions that are parametrised by graphs and build the graph calculus on a suitable quotient of the monoid algebra A[G]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {A}[G]$\end{document} corresponding to a certain function space A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {A}$\end{document} and to the free monoid G in finitely many graph variables; a derivative of an element of A[G]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {A}[G]$\end{document} with respect to a graph yields its corresponding group action on A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {A}$\end{document}. The present result and the graph calculus have three potential applications: the non-perturbative large-N limit of tensor field theories, the solvability of the theory by using methods that generalise the topological recursion to the TFT setting and the study of ‘higher dimensional maps’ via Tutte-like equations. In fact, we also offer a term-by-term comparison between Tutte equations and the present Schwinger-Dyson equations.


Introduction and Motivation
The quest for laws of physics near the Planck scale leads some quantum gravitologist and quantum cosmologists to replace the smooth space-time paradigm with new geometrical structures that are suitable for said energy scale. Those new structures include discretisation of space-time (e.g. causal dynamical triangulations [2]), the algebraisation of space-time (e.g. noncommutative geometry [16,42]), just to name some. 1 Already the sole description of a space-time by a single mathematical object is expected to require therefore novel geometrical ideas.
If one adopts a path-integral approach, the exploration of the quantum theory of space-time requires additionally a multi-geometry description, to which 'offshell' geometries also contribute. Each of these geometries ξ is weighted via exp(iS(ξ )/ )dξ by a 'classical' action S(ξ ), bounded to resemble the Einstein-Hilbert action in the classical limit, in which ξ starts looking like a Riemannian or Lorentzian manifold.
Random tensors [1,10,28,56] and related theories construct these kinds of measures dξ , offer precisely a built-in description of both random and discrete geometry in arbitrary dimensions, and therefore constitute a tool to test models of background independent quantum gravity (see e.g. [23]). Interest in the study of Euclidean quantum field theory (QFT) aspects of random tensors leads to tensor field theory (TFT) [9,11,49,58,61], the matter of this article. TFT fits in a 'QFT + ' framework, that is to say a conservative modification of QFT, which one can pursue in the perturbative or non-perturbative approaches. The origin of TFT can be traced back to Group Field Theories [17,27,29,36,46] (in fact, for abelian GFT's the present results hold, even though not explicitly stated).
Non-perturbative TFT deals with the geometry of boundary states. Single geometries in TFT are represented by certain decorated graphs called coloured graphs; this decoration is precisely the information that allows the construction of PL-manifolds from graphs. Bulk-geometry graphs -Feynman diagrams of TFT-have a colour more than the graphs that triangulate the boundary geometries, which are called therefore boundary graphs (∂-graphs, for short). The two-fold purpose of this article is to define in abstract way a calculus with coloured boundary-graph variables, and shortly afterwards, to apply this construct to a particular problem in non-perturbative TFT.
The single-variable graph calculus has been used there as a toolkit for nonperturbative field tensor theory, leading to the full Ward-Takahashi identity [53]. The single-variable graph calculus allows to define each correlation function as a graph derivative of the free energy. Boundary graphs turn out to classify the correlation functions of tensor field theories; these obey analytic 2 Schwinger-Dyson Equation (SDE). SDE for tensor models, which do reduce to the matrix models loop equations for rank-2 models, were found by Gurȃu [30,31]. Gurȃu's work [29] is crucial for the modern and evolved TFT. However, the method presented here does not use Gurȃu's results on SDE; in fact, the objects described here differ from those considered in tensor models: while tensor model SDE describe relations between expectation values of observables, the SDE of tensor field theory are obeyed by correlation functions (Green's functions). The interest on the latter relies on Constructive Tensor Field Theory [57] and might find application in Group Field Theory. Unless otherwise stated, the SDE we refer to are those of TFT.
Each and every analytic SDE for a connected correlation function corresponding to a connected, but otherwise arbitrary, boundary graph was presented in [51] in terms of a general formula that relates a given correlation function with its neighbourings (relative to the number of points) in terms of simple graph operations. In order to obtain these results, the single-variable graph calculus was a useful tool, which however does not assist any longer in the the derivation of SDE for connected correlation functions with disconnected boundary. This derivation requires a multivariable graph calculus, the variables being the different boundary components. The graph calculus introduced here is general and abstract -in particular it does not depend on the details of the theory (dynamics, symmetries)-but it is meant as a tool for TFTs with complex tensors. It therefore specializes in bipartite graphs.
We introduce graph-group actions as the basis of the multivariable calculus, and study their generating functionals. Concretely, we obtain formulae for the graph derivative of products of functionals, i.e. the corresponding Leibniz rule that generalises when one replaces usual partial derivatives ∂ μ (say, with x μ a coordinate of R n , and F, G real-valued smooth functions there) by derivatives ∂ g = ∂/∂g with respect to a graph g. The formula for graphs takes a different form, but reduces, as it should, to (1.1) when one replaces functionals with functions and simultaneously considers trivial group actions. We prove that this abstract structure underlies tensor models functionals and use it to find a general formula for the SDE of the quartic 'pillow'-model, for the connected correlation functions with arbitrary disconnected boundary (abbr. disconnected-∂). This is the missing piece that complements the connected-boundary SDE-pyramid obtained in [51]. To have it complete is important for the analysis of the nonperturbative large-N limit of tensor field theories. Moreover, although it is not clear which recursion should generalise the topological recursion [25], it is clear that the disconnected-∂ correlation functions play an important role. 3 The geometric spirit of taking graph-derivatives can be understood as the tensor field theory counterpart of 'taking residues' in matrix models (cf. [26,) T l 1 ...l κ = Res x 1 →∞ . . . Res x κ →∞ x l 1 1 · · · x l κ κ W κ (x 1 , . . . , x κ ) in order to project the free energy W κ (with κ boundaries) of a matrix model onto the generating function T l 1 ...l κ of random maps with κ marked faces with fixed perimeter lengths (l 1 , . . . , l κ ). After the well-known equivalence [26,Thm. 2.5.1] between Tutte equations [63,64] for the enumeration of random maps and the loop equations for a suitable matrix model [44] (also summarised here in in Section 5.2), we can state the present result as the basis to obtain Tutte-like equations for the higher-dimensional analogue of the generating function of random maps T l 1 ...l κ . This improvement over [51] -where only the equations analogous to a single-boundary correlator, say T l 1 's cousin, are presented-requires new developments: A straightforward generalisation of the proof given in [51] is impossible due to the absence of the multi-variable graph calculus. Although it would be possible to state the main result solely in a TFT context, the full notation would be a burden in the proof. We state some results in lighter notation and offer a shorter proof, at expenses of introducing some new concepts. The output of the main theorem is also a set of new graph operations that extend those used to describe the connected-∂ SDE in [51]. Also the edge swap 4 ς a (see Fig. 1), as unary operation on a connected graph, is extended to a binary operation implying two connected components; ς a is then interpreted, following [52], as their connected sum.
This article is divided in an abstract part (Section 2, whose main results are Lemmas 2 and 3), and a TFT-part. The next section explains in detail the following mnemonics: for coloured graphs g and h, Here δ(g, h) = 1 if the graphs g and h are isomorphic, and δ(g, h) vanishes otherwise; here G(g) is a group determined by g. In Section 3 we make the connection between the two first sections and model-independent TFT. In Section 4, our quartic model is detailed and the results of the previous sections are applied to the main problem, namely to find the SDE for connected correlation functions with arbitrary disconnected boundary with arbitrary number of connected components. We highlight in Section 5, preparing an important future task to apply our results, the term-to-term parallel between Tutte equations and those presented here, as well as analogies in the derivation of both sets of equations. Concretely, we compare the new operations on the boundary graphs of TFT (Table 4) with their matrix models counterpart ( Table 2). The operations and terms presented in the SDE of [51] are only the counterpart of those matrix models SDE presented in Table 1. Section 6 gives explicitly some of the SDE for 4, 6-point functions for rank-3 theories. The conclusions and outlook are given in Section 7, discussing a potential application related to the higher-dimensional analogue of the topological recursion. The useful coefficients that encode the insertion of the 4-point functions into the 2-point function and the 6-point functions into the 4-point functions are given in the Appendix A.

Graph Calculus
In this section we explain what we mean by graph calculus. For naturality reasons we consider the empty graph ∅ as coloured and add it to the set of (possibly) disconnected, closed, regularly edge-D-coloured, vertex-bipartite graphs ('D-coloured graphs') Grph ,cl D , to form G D = {∅} ∪ Grph ,cl D . This is in line with other theories (as a matter of fact Topological Quantum Field Theories) that need the empty Dmanifold. Also, it is technically advantageous and not the first time it is considered, see for instance [35]. Last, but not least, it is physically 5 required, since ∅ is related to the Fock vacuum in the second quantized formulation of TFT. Henceforth, all graphs are coloured, but other types of graphs could be used for the next constructs.

Single Variable Graph Calculus
We regard G D with a monoidal structure, the product and the unit being given by respectively, for all c, c 1 , c 2 ∈ G D . We choose to remember the order of the factors, so this product is generally non-commutative, c 1 c 2 = c 2 c 1 .
Definition 1 (System of graph-group actions) For a finite collection H ⊂ G D , consider the following structures: -for each connected graph c ∈ H : 5 An anonymous referee is acknowledged for this remark.
-a set V(c) is associated with c; for the empty graph, V(∅) = { * } is the singleton -a finite group G(c) and -a group action G(c) The collection {V(g), G(g)} g∈H is a system of graph-group actions. If additionally, for each graph in g ∈ H , one has functions then one says that {u g , V(g), G(g)} g∈H , or more succinctly, {u g } g∈H is a family of functions supported on {V(g), G(g)} g∈H .
We are interested in triples {u g , V(g), G(g)} g∈H and formal sums of the type U = h∈H u h h, which we refer to as their generating functionals. In this case we say that (the set of graphs) H spans U . Why these are functionals instead of functions will become apparent while addressing the applications. At this point also the following terminology, inherited from the physical significance, might seem mysterious: we call the elements of V(g) the momenta of the graph g. Notice that u ∅ is a constant.
As the last reference to TFT in this section, we clarify that the nature of these graphs is not important at this point; examples will be presented in later sections. We just clarify the reader that is well-versed with tensor models, that graphs treated here are not Feynman graphs, but boundary graphs of these in a rank-D TFT. In this context, functions u g are unknown, 7 and one derives equations that they should satisfy. Only after knowing solutions we would be able to fix a function space u g should belong to, which is for now unspecified. We vaguely refer then to them as 'functions'.
Next, some words on notation. For a factorisation g = c 1 · · · c n in connected graphs c j = ∅, we let g/c i be the graph with the i-th connected component deleted, Notice that this deletion does not only care about the graph-class, but also about its spot in the factorisation, which we can keep track of thanks to the monoidal structure of G D .
For g = c 1 · · · c n as before, let Y ∈ V(c r ), 1 ≤ r ≤ n. Given a function v g : 6 One could relax this condition so that there exist domains U(g) of V(g) compatible with the G(g)-action. However, we keep the natural condition (2.1). 7 For instance, u g can be the correlation functions.
Definition 2 Let H ⊂ G D span the functional U = g u g g. Given any connected graph h ∈ G D , h = ∅, and an arbitrary graph g = c 1 · · · c n factorised in connected components c i , we define is the subset of numbers that indexes the factors of g that coincide with h. For r ∈ I (g, h), we label by h (r) the appearance of h in the r-th factor of g = c 1 · · · c n . We define the functional graph derivative with respect to h (evaluated at X) as the functional The well-definedness follows from condition (2.1), which implies that in each case ι r σ (X) u g is indeed a function on V(g/ h (r) ). We stress that this derivative could be defined in a proper domain U(h) of V(h). Further, if h occurs nowhere as a factor of g the sum is empty, and thus δU/δh ≡ 0. The derivative with respect to ∅ is the coefficient of that graph, δU/δ∅ := u ∅ ∈ C.
To clarify this definition, consider a monomial functional, U = u g g, with g = h n for some integer n ≥ 1 and h a connected graph. By definition, one has which one can rethink as To illustrate the action in slightly more generality, if in u c 1  On this account, the useful symbolism to keep in mind is that the derivative of a graph with respect to itself is the group action of G(h) on V(h), In the sequel, we will often abuse on notation and write this equality without the curved action-arrow, as we already did above in (2.2). The moral is that each factor h occurring in a term of the type u c 1 ...c r−1 hc r+1 ...c n (c 1 . . . c r−1 hc r+1 . . . c n ) is a potential G(h)-orbit of the r-th argument u c 1 ...c r−1 hc r+1 ...c n .
For iterated derivatives with respect to h, one can see by induction that for n ≥ 2, the iteration of n graph derivatives applied to h n yields is the i-th factor of the group G(h) n , a more transparent notation of last equation is where the group G μ(i) (h) acts on the i-th factor of the set V(h) · · · V(h). The group corresponding to the n-th derivative of the n-th power of a graph h with respect to itself is δ n (h n ) δh δh · · · δh = G(h) S(n) . (2.8) In this case, the wreath product G(h) S(n) is the semi-direct product G(h) n ψ S(n), with the obvious action ψ of S(n) on the n copies of G(h).

Examples of Graph-Group Action Systems
Roughly stated, a multivariable graph calculus (of n graph variables) consists of generating functionals of functions u g supported on a system of graph-group actions {V(g), G(g)} g∈H that are spanned by a finite set H . We take H ⊂ FM({h 1 , . . . , h n }), the free monoid generated 8 by n non-isomorphic graphs h = {h 1 . . . , h n }. For a multivariable graph calculus the key property is that the graph-group actions G(h i ) are pairwise independent, that is for each i, j = 1, . . . , n, For the special element g = h α 1 1 · · · h α n n the restriction imposed by (2.10) implies Before formally defining multivariable graph calculus, the next examples are just meant to illustrate last action (2.11), rather than the role of the graphs in graphgenerated actions, and therefore can be skipped (to Section 2.3).
Example 1 Let ζ n = 1 denote a n-th root of unit (n ≥ 2), and consider the system of graph-group actions with a single graph g. Let G(g) be the group spanned by ζ n V(g) = C by multiplication. Then the functional graph derivative of g with respect to itself on the identity id C vanishes identically: The G(g)-orbit of the function f n : z → z n yields δg δg(z) (f n ) = n · z n .
Example 2 Consider a finite set H ⊂ FM(h) and the following graph-group actions system Here |g 0 | is the number of vertices of g. The action of the symmetric group on the matrices permutes columns (or rows). Then the orbit of the determinant det : V(g) → R vanishes identically. This follows from considering, for an arbitrary matrix X = (X ab ) ∈ V(g), where A is the alternating subgroup; its complement in the symmetric group consists of odd-degree permutations, whence the common minus sign in the last line. Both have the same order, which explains why the sum vanishes independently of X.
Example 3 Let D ∈ Z ≥1 . Let two non-isomorphic graphs H = {g, h} ⊂ G D parametrise the system of graph-group actions given by {V(l), G(l)} l∈H , being Then the functional graph derivative of g 2 f with respect to itself yields the following group-orbit, when applied to F : We have used the invariance under the action of two copies S(D), which contributed a factor (D!) 2 .

Multivariable Graph Calculus
Let h = {h 1 . . . , h n } ⊂ G D be a set of connected, non-isomorphic graphs. For the basis of the multivariable calculus the free monoid FM({h 1 , . . . , h n }) is too 'verbose', and not each one of its elements has the ordered form h α 1 1 · · · h α n n . This could in principle be solved by taking the free commutative monoid FM ab (h) instead, which, however, tuns out to be overly restrictive (for our aims). A mild compromise between these two alternatives -the free monoid and its abelianisation-is to allow to permute letters in an arbitrary word, as to make use of the action (2.11), and then in some sense undo the changes. Next definition introduces precisely such reordering.

Definition 3
Given a finite set of graphs h = {h 1 , . . . , h n }, the degree |g| of an element g in FM(h) is the number of factors of g, i.e. the number of connected components g consists of. We let S(|g|) act by permuting the factors of g, g → σ (g); notice that S(|g|) left-acts naturally as σ · f = f • σ −1 on functions f : V(g) → C. Given a family of functions {u g } g∈H supported on a system of graphgroup actions {V(g), G(g)} g∈H ⊂FM(h) , and given a g ∈ H , we declare the pairs (u g , g) ∼ (σ · u g , σ (g)) equivalent for each σ ∈ S(|g|). The notation we choose for this equivalence, called reordering, is (2.12) Definition 4 Given a finite set h = {h 1 , . . . , h n } ⊂ G D of connected nonisomorphic graphs, a system of graph-group actions S = {V(h), G(h)} h∈h is said to be independent if (2.10) holds. When the context is clear, we just say that 'h is independent', or that S is.

Definition 5 A multivariable graph calculus C(h) or a graph calculus with variables
h consists of two objects: -the choice of an independent system of graph-group actions {V(h), G(h)} h∈h for a finite set h ⊂ G D and -the set of finite formal sums in elements of g ∈ FM(h) having each of these a function of the form v g : V(g) → C as coefficient, modulo reordering. That is, where ∼ is the linear extension of relation (2.12), abusing on the same symbol.

Algebraic Structure
We now explore the structure of a graph calculus C(h) with variables h = {h 1 , . . . , h n }. The elements of C(h), called also functionals, have a non-unique representation, since g v g g = g vgg whereg = τ g (g) and vg = τ g · (v g ) for an arbitrary τ g ∈ S(|g|). For sake of computability, it will be helpful to be able to fix representing elements g that span a functional, and subordinate the order of the arguments of the coefficient-functions to that choice.
We write g c ∼ h for any g, h ∈ FM(h) if g = h in the free commutative monoid FM ab (h) spanned by h. In other words, g ∼ c h if and only if h and g match in FM(h) up to a rearranging σ ∈ S(|g|), i.e. if σ (g) = h.

Definition 6 Given a family of functions {v
We shall drop the subindex g in Θ g ( ) when the context is clear. If one factors g as g 1 g 2 with respect to an 'abelianised' product, an element σ ∈ S(|g|) serves as correction, so that σ (g 1 g 2 ) = g. Their rearranging yields Θ g (u g 1 t g 2 ) = σ · (u g 1 t g 2 ) for suitably chosen functions u g 1 and t g 2 . In general, the collection of graphs g 1 , . . . , g r is not required to be connected. If the context is clear, we pick this rearranging element in a smaller group σ ∈ S(r) that only permutes the arguments of V(g i ).
Definition 7 Denote by H 1 H 2 the subset {g 1 g 2 | g a ∈ H a } in the free commutative monoid FM ab (h) spanned by an independent set of graphs h. Given two functionals whose coefficients v g are given by the 'ordered convolution' (2.14)

Lemma 1 This product on
It suffices to exhibit an element ν ∈ S(|g|) that satisfies Θ g (u j t l ) g = Θ g (t l u j ) ν(g). This ν will be next constructed.
We have the freedom to assume that . . , n. In the notation introduced above, # I (j, h i ) = θ i and # I (l, h i ) = λ i . We begin by assuming that the relations above are equalities, and restore towards the end the more general form (2.15). Let |j | = θ 1 + . . . + θ n and |l| = λ 1 + . . . + λ n be the orders of j and l. We define first σ ∈ S(|g|) as the (|j |, |l|)-shuffle determined by Each h i before double bar in the first row is a factor of j ; after the double bar, the h i 's represent the factors of l. The lower is a factorisation of g. Thus the diagram states that σ (jl) = g. Analogously, we can define a (|l|, |j |)-shuffle ρ that satisfies ρ(lj ) = g. This is depicted in the following diagram, in which we represent l to the left of the double bar and j to the right.
One has ρ(lj ) = g = σ (jl) but this still does not guarantee that ρ −1 σ (v jl ) =ṽ lg . In order to correct this, we define certain permutations τ i that are constant everywhere except in the elements pertaining a particular h i for fixed i. This embeds S(# I (g; h i )) ⊂ S(|g|). Notice first that for each such element μ ∈ S(# I (g; h i )) Then the sought-after ν is which by construction satisfies The map ν is thus given by We now come back to the strongest, original statement, in which l and j have the form (2.15), instead of (2.16). This means that there are permutations γ ∈ S(|j |) ⊂ S(|j | + |l|) and δ ∈ S(|l|) ⊂ S(|j | + |l|) with γ (j) = h θ 1 1 h θ 2 2 · · · h θ n n and δ(l) = h λ 1 1 h λ 2 2 · · · h λ n n .
(2.18) Then we correct ν by these two elements: which satisfies, in the most general case, (2.17). The statement follows by linear extension of it.
Example 4 To illustrate this notation, consider the sets H = {fg, f 2 } and K = {fg, g 2 } of coloured graphs and let U = e∈K u e e and T = e∈H t e e. If X A are momenta of f and Z A of g (for A = 1, 2), we pick a particular graph l = f 2 g 2 , and define the following permutations in S(4) Structures appearing in the graph calculus resemble the monoid ring. Given a commutative unit ring R and a monoid M, the monoid ring [38, Ch. II] is built by formal finite sums in M with coefficients in R, and endowed with the convolution product. The structure of the graph calculus generated by n variables h = {h 1 , . . . , h n } requires to define, instead of the ring R, the collection A of algebras of functions and then to consider the following restricted version of the monoid algebra Then we see that for a scalar x ∈ C, the functional xU is defined by componentwise multiplication by x, The in-depth study of the structure of C(h) is beyond the scope of this paper. Here, we will prove the properties that are useful to in later sections.
We observe that the Borel transform BA(j ) of a series A(j ) = n a n j n , given by BA(j ) = n (a n /n!) j n , can be seen as the rescaling of the coefficients of each j n by the inverse of the symmetry factors n! = #S(n) = #Aut(× +) of the n-valent graph × +. The association with a graph comes from the ordinary field theory, where × + represents the n-point function. The series A(j ) are promoted to functionals A[J ] in a source J , now a function, and the coefficients of J n /#Aut(× +) are the correlation functions. This inspires (although this will be clear only after Section 3) the terminology of next definition. We warn that the name 'Borel' is purely formal and should not evoke any transfer of convergence properties from the ordinary to the colored case: h∈H v g g be a generating functional of graph-group actions. Then define its coloured Borel transform by If H ⊂ G D h, the following set will be relevant for the next lemma.
for each c a , c b ∈ h, where a and b denote the number of factor (connected component) where c a and c b are located, respectively. Moreover, assume that v c 1 ···c r ···c p is invariant under G(c r ) for each factor c r , 1 ≤ r ≤ p. Then, one has for h = c r , being ι 1 X the insertion of momentum X of h at the first argument of the function v hg .
Proof By assumption, one can bring every element g ∈ H to the form g = h α 1 1 · · · h α n n , and change the coefficients v g accordingly without alteration. Notice that each g ∈ H can be further factorised as h f , where δf/δh ≡ 0, and depends on g.
Through direct computation, . Throughout, we can assume ≥ 1, since this is required for a summand in the first equality of (2.20) not to vanish. Also, since the orders of the groups should satisfy Hence, after cancellation one gets

Definition 9
The graph derivative ∂U/∂h of a generating functional of group actions U is given by the coefficient v ∅ of the empty graph ∅ of the functional derivative of U with respect to h, δU/δh =: g v g g, to wit Parenthetically, the difference in notations for 'partial derivative' and 'functional derivative' does not intend to mirror any difference between multivariable ordinary and functional calculi.
The next result is simple and useful at the same time: Then the graph derivative of the product V = U · T = g v g g is Proof We compute directly the derivative of the product U · T with respect to g from the ∅-coefficient of δ(U · T )/δg: For the second equality we inserted the coefficients explicitly, according to the definition of the product. The fourth equality holds by graph independence, (2.10), guaranteed for a graph calculus.
From now on let 2k(g) = |g 0 | denote the number of vertices of g ∈ G D . Our canonical example of system of graph-group actions have the form Due to the rigidity of a coloured graph, each automorphism 9 π of a connected graph g is determined by a permutation σ of the black (or white) vertices of g; we write π =σ for such σ ∈ S(k(g)). The action of the coloured automorphismsσ ∈ Aut c (g) ⊂ S(k(g)) on M D×k(g) (Z) is by permutation of the matrix columns, y i → y σ (i) , i = 1, . . . , k. As a notational remark, we will often write k instead of k(g), as we just did, if the context is clear.

Three Limit Cases and Examples
The previous lemma implies the Leibniz multivariable rule. Before elaborating on it, for the case of graph-group actions by automorphisms, G(g) = Aut c (g), it will be helpful to exhibit this group action on a function v g in three limit cases, according to the graph type of g.
We describe now the action of Aut c (g) on a general function v g : the following holds: which is short-hand notation for (1) , . . . , σ α n n X n μ n (α n ) ) .
Usually, it is summed all over Ω ∈ Aut c (g), which being a group, allows us to choose whether we put the inverse in (2.26).

Tensor Models
In this section, we implement the graph calculus for TFT.

Tensor Field Theory
The main idea to use a the Ward-identity [22] in order to decouple the Schwinger-Dyson equations (at a planar sector) and to obtain a master integral equation for the 2-point functions for matrix models [32] can been extended to the TFT setting. Some progress along these lines has been made for complex tensor field theory and consists in the further study [53] of the Ward-Takahashi identity of Ousmane-Samary [48] in order to descend the SDE tower [51] and eventually find closed equations. This led lately to the large-N limit [50] of the connected-∂ SDE. We treat a TFT as inspired by group field theory [7,11,17,61].
Unlike matrix models, where there is a canonical way of forming a scalar, for tensor models a specific trace Tr B , indicating how to contract the indices, should be specified. These traces Tr B are indexed by D-coloured graphs B, where D is the rank of the tensors ϕ x 1 The graphical representation of these traces derives from to the independence of the imposed transformation rules under the action of U(N) on the spaces corresponding to each index x a of ϕ x 1 ...x D ,φ x 1 ...x D , for a = 1, . . . , D, deemed colouring. That is to say, to form invariants only indices of identical colour can be contracted.
Therefore, a trace corresponding to a quartic interaction would be, say, formed by colour-wise contracting the indices with deltas, as follows: The actual index-set of the tensors is {1, . . . , N}, but thinking of N as a large integer, we typically write these sums over N or Z, or omit the domains in the sums. Although orthogonal groups [20], compact symplectic groups [18] and mixed symmetries [62] define other classes of tensor models, we restrict our discussion to the U(N)-tensor models we just introduced.
A tensor model is thus determined by a dimension D (the rank of the tensors) and an action S[ϕ,φ] given by a finite sum of traces indexed by connected D-coloured graphs. The partition function is given by Its logarithm, W [J,J ] = log Z[J,J ] is the free energy and generates the connected correlation functions, which as pointed out before, are classified by boundary (possibly disconnected D-coloured) graphs.

From Graph Calculus to Tensor Field Theory
For a deeper exposition and motivation of the terminology and proofs of the results exposed in this section, we refer to [53]. Some objects of interest in tensor field theory are functionals generated by graphs (e.g. the free energy). By this we mean expansions in graphs with functions (or distributions) as coefficients. For a graph g ∈ H ⊂ G D we recall that 2k(g) denotes its number of vertices. One is interested in collections of functions Here J(g)(X) = k(g) α=1 J x αJ y α , where {y α } α are determined by g and X through g * (X) = (y 1 , . . . , y k(g) ) . (3. 2) The induced map g * is defined as follows. The D-tuple x α (resp. the y α ) indexes white (resp. black) vertices in a graph. Then g * : M D×k(g) (Z) → M D×k(g) (Z) is given by X = (x 1 , . . . , x k(g) ) → g * (X) = (y 1 , . . . , y k ), where y α c = x ν c (for α = 1, . . . , k) if and only in the graph g there exists a c-coloured edge starting at x α and ending at y ν . As before, X is called momentum, but also each one of these arguments x α is referred to as (entering) momentum of the white vertex J x α . Similarly y ν is the (outgoing) momentum at the black vertexJ y ν ; the terminology relies on Fig. 2. Although an ordering of the vertices is assumed, notice that J(g) is independent of it.
Consider For a connected graph g, the elements of Aut c (g) are a liftσ of an element σ of the symmetric group S(k(g)) (see discussion below (2.22), or [53] for details). Using (3.2) and the induced map g * to define the next derivative 3) Fig. 2 Left. On the interpretation of the induced map g * . One takes any representing graph G such that ∂G = g. For the quartic melonic model (pillow-interactions) we can do so because it has been proven in [53] that the spectrum of boundary states is full, which is to say, the boundary graphs are all of G D . Assuming an ordering on the white and on the black vertices, the components y α of g * (x 1 , . . . , x k ) = (y 1 , . . . , y k ) are determined by this picture, seeing the x μ 's as independent momenta entering the graph, with output g * (x 1 , . . . , x k ). Right. If , and we choose the numeration x α 1 = y α 1 for α = 1, 2, 3; there that G satisfying is shown. The map is determined by following the 0a momenta lines for each colour a one can give this derivative the the meaning of (1.2) as a permutation of the arguments of u g , that is (σ · u g )(x 1 , . . . , x k(g) ) : = u g (x σ −1 (1) , . . . , x σ −1 (k(g)) ) , (3.5) for all X = (x 1 , . . . , x k(g) ) ∈ F D,k(g) . The property 11 Equation ( In order to obtain ∂/∂g(x, y), with , one has to evaluate the sources at zero. Beware (x, y) ∈ F 3,2 for the graph derivative to enjoy of property (3.4). (3.4) it is summed over the group Aut c (g). We are therefore entitled to drop the inverse in the RHS in (3.5). However, if the sum is not over all the group, we will keep the right 'orientation' of the action, for the convention in single terms (σ · u g ) is important in that case.

Remark 1 Notice that in
For graphs h, g, functions u g and functionals U [J,J ] we abbreviate the usual notation as follows: U = g u g g , u g g := u g J(g) and gh := J(g)J(h) , (3.7) and treat the latter as a product of graphs. The functional U depends on the sources through the graphs according to (3.7). This product is not considered commutative, since the star implies an ordering in the arguments of a function u gh , which need not satisfy u gh = u hg . Now we exhibit the relation to the generating functional of group actions. With the product defined above, consider the functional V ≤n that generates the connected correlation functions of TFT (with G ∅ = 0). Here n is a large integer, and G n D is a finite set of coloured graphs whose elements D satisfy #(vertices of D) ≤ 2n . would declare vanishing all the floors above the n-th floor of the SDE-tower, but we can increase n at desired accuracy. It bounds any graph D appearing in an non-identically vanishing correlator G D to have n components at most. In rank 3, since the canonical (optimal in number of vertices) 3-coloured graph of genus g has 4g + 2 vertices, this truncation bounds the genus through 2g + 1 ≤ n, making higher-genera boundary states vanish. We write the infinite sums keeping in mind that we mean their n → ∞ limit. The coloured Borel transform of V ∞ = lim n→∞ V ≤n is called the free energy: This equation holds in 'N = 1-units' and this assumption is innocuous within the scope of this article. However, if one plans to proceed perturbatively in 1/N, the realistic case that drops this simplification ought to be addressed. Adding the power counting conjectured in [50] that scales G D → N γ (D) G D , where γ (D) is certain factor already determined for the 2-pt and 4-pt functions, would help analysing the convergence of W (see Section 7). This free energy functional (but not only this) corresponds to a system of graphgroup actions that has the following constituents: For connected graphs B i and B j , the following holds [53,Lemma 4]: One can then operate with functionals, now without needing to evaluate the sources at 0. That is, This object is, unlike the function ∂U/∂g, a functional that can be graph-derived again (without getting something a trivial result) and get again a functional generated by graphs. Contrast this with (3.3), whose result is a function. Another important functional in the next derivation is the so-called Y -term that emerged in the derivation of the Ward-Takahashi identity [53] and which encodes all the pertinent insertions of 2p point functions into 2p − 2 point functions for all p.
The expression to order six is given in [51,Lemma 4.1], but this article only will evoke the Y -term up to order four, located in Appendix A. For this paper, it is sufficient to additionally know the expression where c ∈ {1, . . . , D} is a colour and x ∈ Z. It is important to notice that unlike W (for which we set G ∅ = 0), there is a non-vanishing constant term f x . For B with more than 2 vertices, each function coefficient f B,x of a graph B denotes a triple propagator contraction of vertices from with vertices of the graph A having 2k(A) = 2 + 2k(B) vertices and such that the whole contraction's boundary is B. An illustration is given in Fig. 3, but see [53] in order to understand the role of the number x (here not used) as well as the definition of Y -term, if needed beyond the expressions given here in Appendix A. Although G A is symmetric with respect to action of Aut c (A), the resulting insertion need not to be Aut c (B)-symmetric. B are constructed out of those correlation functions G A having the next property: when A (or to be precise the cone 13 of A) is triply contracted with a colour-c quartic melonic ('pillow') vertex, as shown is this picture, the boundary of the resulting graph is B. It is a condition that two of the vertices of the interaction pillow are contracted with two vertices directly joined by a c-coloured edge, but there might be more edges between those two vertices. This explains the appearance of f (c) B in the SDE's for B, as will be proven. This description still does not fully determine f x still depends on another parameter x that determines how to contract the third leg, not shown here. For a rigorous definition we refer to [53] In order to derive any of the 2p-point SDE 14 we shall employ the graph calculus C(h) with variables h = {connected, closed, D-coloured graphs with ≤ 2(p + 1) vertices}, being the system of graph-group actions the canonical one given by automorphism groups (see (2.22) above for details).

Disconnected-Boundary Schwinger-Dyson Equations
The next section introduces the model whose SDE are found in Section 4.2.

The Quartic Melonic Tensor Field Theory
The ϕ 4 D,m -theory is the model with quartic interaction vertices V [ϕ,φ] = λ D a=1 Tr V a (ϕ,φ). These vertices are sometimes called pillows, since the graphs they correspond to have that appearance: We analyse this theory with an abstract Laplacian E : Z D → R ≥0 as propagator, , assumed here to satisfy the following technical assumption: for each colour c, the difference is independent of the fixed momenta in colours different from c. Such kind of technical conditions permit to exploit the Ward-Identity and are common. In matrix field theory [32,Thm. 2.3], this is analogous to the assumed injectivity of n → E n for the generalised matrix Laplacian E matrix = diag(E n ) n∈N there.

Main Result
We prepare 15 now some notions and notations needed for the formulation of the main result. Let R be a connected graph, 2r its number of vertices, and X ∈ F r,D . Given a colour c and a numeration w 1 , . . . , w r of the black vertices of R we set, for any 1 ≤ ρ ≤ r, Thus, τ belonging to this set indexes the vertices w τ at which a swap of the colour c edge at w τ and w ρ disconnects R. In other words, Br (2) (R, ρ, c) indexes ccoloured edges of R that, paired with the c-coloured edge at w ρ , form a 2-bridge. If Br (2) (R, ρ, c) = ∅, then R must be, in particular, 3-edge connected.  (y 1 , . . . , y β , . . . , y This s determines both a connected graph component R of D, and an r-tuple X 0 ∈ F r,D of momenta, being 2r the number of vertices in R, by asking that s appears listed in the r-tuple R * (X 0 ), particularly. Different choices of the distinguished momentum variable s -say s = y β 1 and s = y β 2 -lead to a different SDE whenever the respective β 1 -th and β 2 -th black vertices lie on different connected components; or, less obviously, when such vertices do lie in the same connected graph, R, but they are not related by a non-trivial element of Aut c (R). In particular, if the distinguished connected component R has no symmetries, then there are exactly half as many SDE's as vertices of R, to wit k(R) equations (for that connected component). For the rest of components of D we write Q (D = R Q). We factorise Q in α u copies of pairwise non-isomorphic connected graphs {Q u } u=1,...,n : We split the d-tuple X into momenta X 0 of R and momenta X of Q, so that (X 0 , X) = X, up to reordering. For τ ∈ Br (2) (R, β, c) we can therefore write and accordingly split the momentum X 0 in momenta X 0 of R and X 0 of R , X 0 = (X 0 , X 0 ). Furthermore, for any factorising pair of graphs we define the two functions H (c,τ )

C,B and I (c)
C,B by the following products: where the reorderings Θ Q refer only to the graph components of the graphs in the pair (C, B). The pivotal term, appearing in each equation, is where the denotes the 2-point function and (s c , qĉ) is shorthand notation for the D- tuple (q 1 , . . . , q c−1 , s c , q c+1 , . . . , q D ). Notice the implicit colour-reordering bringing the s c argument to the c-th place. The sum in last equation then runs over the D − 1 arguments of qĉ = (q 1 , . . . , q c−1 , q c+1 , . . . , q D ).
The appearance of the 2-point function is due to the fact that the coefficient of a certain graph B in the Y -term is related to correlation functions indexed by graphs that after certain dipole removal yield B (however, this description does not fully determine Y -for a true definition, see [53, pages 619-624]). Since the melon is a D-dipole, removing the dipole yields the empty graph. For other graphs, the coefficients are given in the Appendix A.

Theorem 1 For the ϕ 4
D,m -theory with kinetic term (4.2), the Schwinger-Dyson equations for the disconnected graph D read, for the particular vertex choice s = y β , as follows: Proof By definition, Spelled out, this means that To compute G D , one needs to start then with a functional derivative of W with respect to a source, which we choose to beJ s =J y β . The partition function Z[J,J ] = exp(W [J,J ]) has been shown [53] to satisfy The colour-c-WTI [53,Thm. 2] can used in the first line to directly compute:   c , respectively. Next, we use the freedom to numerate momenta starting with the component R, (4.13) The splitting of b and d into terms b (dd) , b (prod) , d (dd) , d (prod) , respectively, still makes sense. We now determine all coefficients, beginning with the easiest.
The c c and f c terms are readily computed: The term c c itself is not finite, but a term arising from one of the three functions will render it finite. The three remaining m c -functions involve derivatives of products of functionals. We first observe that the 2r − 1 derivatives in the sources complete the graph derivative δW/δR, so the a c yields a c (X; s; D) = δ α δQ α (X) (4.14) Notice that, after evaluation in the sources at 0, holds for any boundary graphs A, . . . , A . Using the formula for the graph derivative of products (Lemma 3) and subsequently Lemma 2 one deduces We compute now 16 the term d c . We can split D c into the double derivative contribution D (dd) c and the product of single derivatives D (prod) c . If we decompose δ α /δQ α 16 The part of the calculation of the contributions of the double derivatives δ 2 W/δJ δJ or δ 2 W/δJ δJ to b c and d c is shortened, due to the very similar derivation provided already in [51]. and the rest of derivatives implied in R into single functional derivatives,  (4.16) where in the last step we only used that s = y β = y β 0 . It is evident that these two derivatives in the square bracket form of a colour-c edge swap at y β 0 and y ρ 0 , but in order not to lead to a vanishing term, they also have to lie on a different component of a graph (as otherwise a graph derivative would be incomplete). It is therefore additionally required that the graph is disconnected after the swapping at y β 0 and y ρ 0 , that is that there are connected graphs R 1 and R 2 , such that .
At this place we use the multivariable graph calculus Leibniz rule (Lemma 3), namely In summary, the d c -term is given by .
Notice that these expressions imply the non-connected expectation values. The connected ones · · · connected can be obtained by tools from the probability theory relating the cumulants with the momenta (via incomplete Bell polynomials).
3. The crux of the matter is that Tutte Equations (5.1) hold if and only if the SDE (5.3) for the matrix model (5.2) do. The bridge is the following. For closed maps log Z, the logarithm of the formal integral (5.2), is well-known to yield the generating function of connected closed maps (cf. [12]). The formal variables λ α in both cases coincide: if only maps consisting of, say, triangulations and quadrangulations are to be counted, one sets a cubic and quartic interaction in the matrix model (in (5.2) λ α = δ α 3 λ 3 + δ 4 α λ 4 ). For maps with κ marked faces, if x 1 , . . . , x κ are formal variables and one defines W κ by (5.5) in the sense of Neumann series, then T l 1 ...l κ can be recovered by taking residues at x i → ∞ as follows: . , x κ ) . (5.6) Tutte equations (5.1) for all genera g ∈ Z ≥0 emerge by taking the small-t expansion 18

Parallel Between Tutte Equations and Disconnected-∂ SDE of TFT
We contrast now elements appearing in the SDE of Theorem 1 with Tutte equations, as well as the derivation of both sets.
The first parallel, depicted in Table 3, concerns the role of the boundaries in each framework.
..,l−1 splitting in 2 lengths, adding up to l − 1 Moreover, we can regard each Tutte equation as a set of operations in the input, namely the perimeters l 1 + 1, . . . , l κ of the marked faces, and distinguish the two cases κ = 1 and κ > 1. The output for the connected-∂ Tutte equations (5.1a) is illustrated in Table 1; similarly, for the disconnected-∂ Tutte equations Table 2 depicts the types of operations on the list of perimeters.
A second similitude is the role played by a distinguished boundary in each case. Tutte equations can be derived [26,Ch. 1] by distinguishing a single boundary length, say l 1 +1, among the list of perimeters l 1 +1, . . . , l κ , and seeing the possible effects 19 that the removal of a marked edge of this (l 1 + 1)-agon has at the level of the Tgenerating functions. In our TFT SDE, the role of that marked face is taken by the boundary component denoted R. This undergoes the transformations explained in Table 4.
This new operations are an improvement of description given in [51]. Put into the Tutte Equations perspective, the analogue of Table 1 are precisely those operations on a connected ∂-graph of [51]. The contribution of Theorem 1 is to give the full set of operations described and interpreted in Table 4.
One can compare term by term Tutte vs. Schwinger-Dyson equations. The terminology refers to Tables 2 and 4. They do not match 1:1, due to the fact that in TFT the number of operations on boundaries increases.
Finally, boundaries -and therefore SDE-of TFT are more complex than their matrix counterparts due to their lack of symmetry. As pointed out in Section 4.2, the 19 Incidentally, this amounts to four possible scenarios that account for each one of the terms in (5.1b): I. if the marked edge separates an ordinary face from a marked face: this accounts for the term λ α T

Four and Six Point SDE with Disconnected Boundary
Concrete SDE's for the rank-3 ϕ 4 3 -theory are presented next. Recall, the interaction in this case is . We display some of the equations in traditional notation with explicit graphs, which allows to see immediately the graph operations. In other equations we use the simplification clarified in Table 6.

Schwinger-Dyson Equations for
We single out the terms in the derivation of the SDE for this case, which is the most complicated presented here. The rest of the results are obtained in a similar and more direct way.
There are two equations, depending on whether one chooses s (cf. Theorem 1 above) as a component of the outgoing momentum in or in . We choose this last vertex to be , for sake of clarity (since the model is colour-invariant, SDE for the other colours are readily obtained from it).
-If s = x is outgoing momentum of the graph . In the notation of the theorem, here D = m|V 1 being R = m, since y 1 = s = X 0 is the momentum of the black vertex of m. Therefore Q = V 1 . The remaining momenta X equal (y, z). The I (c) C,B -terms are then computed as follows, from any of the factorisations C, B = (∅, V 1 ) or (V 1 , ∅) and read ∅;s c G (6) m|V 1 (x, y, z) (C, B) = (∅, V 1 ) .

Schwinger-Dyson Equation for
There is only one SDE for the 'disconnected-∂' 4-point function. For every (x, y, z) ∈ F 3,3 , Only this equation is not new, but was already (directly) derived in [50], in notation of Table 6.

Schwinger-Dyson Equation for
Similarly, since one can permute the arguments of G (6) m|m|m , it satisfies only one SDE: We kept the graph notation in order to ease the reading of the graph movements. Equivalently,

Conclusions and Outlook
We introduced the multi-variable graph calculus-a tool to prove a general formula for the disconnected-∂ Schwinger-Dyson for the most general quartic-melonic tensor field theory in arbitrary rank (Theorem 1). In their description, a set of graph operations on an input graph has been exposed in Table 4. This list is the tensorial equivalent of the matrix model operations on the boundary graphs of matrix models (cf. Table 2). This exposition is focused on bipartite coloured graphs (a generalization addressing those graphs required by real O(N) D -invariant tensor models [20] would be interesting). Some of these operations are not new, but appear already in the SDE of tensor models (in a tree language [30]; see also [37]) The well-known dictionary between the theory of enumeration of random maps and matrix models allows to pose two uses our SDE could be useful for. The theories of graph-encoded manifolds [21,39,55] bring tensor models into prominence as a theory of 'random higher-dimensional maps'. For instance, gluings of octahedra [13] are studied from the tensor model with (non-melonic) interaction vertex which is the dual graph-representation to an octahedron. The boundary-completeness of the quartic-melonic models [53, Thm 1] further studied here shows a path to the theory of higher-dimensional maps made of gluings of particular triangulations of D-balls, in the rank-D case. The natural candidate for higher-dimensional Tutte equations is the set of relations derived from the 1/N-sectors of the present SDE that have the same boundary as well as value of Gurȃu degree. This is based on the fact (recalled in Section 5) that Tutte equations hide in the N 2−2g−κ -sectors of Migdal's SDE for matrix models.
The second guess is the existence of a recursion allowing to compute higher-point TFT-correlators from some small number of lower-point ones, analogous to the Topological Recursion (TR) [3,15,24,25,60] that satisfy matrix model correlators. What is not speculative is that, assuming the dictionary of last paragraph, such tensorial TR would require the disconnected-∂ SDE, since it is also a recursion in the number of boundaries (presumably also in their Gurȃu's degree). The blobbed TR for quartic tensor models has already been obtained [5]-yet it would be interesting to develop the purely tensorial 20 cousin of the TR for tensor field theory 21 .
The large-N limit of the disconnected-∂ SDE should be analysed in order to access also their physical significance. At leading order, their melonic approximation [47] is expected to yield closed equations. A significant progress in this direction has been 20 The Bonzom-Dartois TR bases on an initial Hubbard-Stratonovich transformation. Vertically cutting the pillow vertices, as the rank-3 , they "map" quartic melonic tensor models to a suitable intermediate field multi-matrix model, for which the authors develop a TR analogous to the introduced by Borot [14]. 21 The difference between tensor models and tensor field theory is here substantial. The former usually focuses on numerical observables Tr B (ϕ,φ) ∈ C and the latter on functions (or distributions) G B : V(B) → C. In contrast, the loop equations, Ward Identities [34] and SDE [30,31] are algebraic in the for tensor models, whereas for tensor field theory 'loop equations' [51,53] are integro-differential, as shown also in [50] explicitly. undertaken in [50], whose techniques could be extended to the present disconnected-∂ SDE in a next project.
Heading towards a quantum gravity perspective, objects appearing in the Functional Renormalization Group [8] -or Ward-constrained flows [40,41]-are expected to be described in terms of graph-generated functionals studied here. Together with the boundary-completeness of the quartic-melonic models [53,Thm 1], this motivates us to study the geometric nature of the flow from a simple quartic model.
Using the bordism interpretation [53] of the correlation functions, the Wheeler-deWitt equation 22 claimed [59] to be formally satisfied by the wave function (q) ∼ ∂g=q D[g]e −S Einstein−Hilbert [g] [33] for a boundary 3D geometry (with metric q) would be worth to explore in this context, probably guided by [6].
On the purely mathematical side, systems of graph-group actions can be extended to Lie groups actions and to calculi in infinitely many graph-variables by using rigorous analytic tools. It would be also interesting to consider the coefficient functions u g directly in certain algebra of functions. One could dispense with the functions {V(g) → C} by using instead directly (non-commutative) algebras.
Finally, the (symmetric) monoidal structure on the set of boundary graphs emerges in a natural way. This guides us towards the language of Topological Quantum Field Theories (TQFT) [4]. Since these boundary graphs triangulate boundary states, an interesting program would be to obtain discrete TQFT from matrix models and 'TQFT with observables' [45] from tensor models, or enframe these in Oeckl's positive boundary formalism (op. cit.), which also facilitates the gluing-boundary procedure that TQFT provides (likely informed by the GFT-treatement of Boulatov and Ooguri models with GFT in [19]). In the tensor and matrix models case, the gluing of boundaries should be implemented as an operation ∧ A on two correlation functions sharing a boundary state A, G A|B|···|C ∧ A G A|B |···|C , which should be related to G B|B |···|C|C due to their geometrical interpretation. licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommonshorg/licenses/by/4.0/.