惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

博客园 - 司徒正美
The GitHub Blog
The GitHub Blog
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Apple Machine Learning Research
Apple Machine Learning Research
L
LangChain Blog
GbyAI
GbyAI
博客园_首页
V
Visual Studio Blog
Martin Fowler
Martin Fowler
WordPress大学
WordPress大学
H
Hackread – Cybersecurity News, Data Breaches, AI and More
博客园 - 叶小钗
腾讯CDC
博客园 - Franky
IT之家
IT之家
Google DeepMind News
Google DeepMind News
Microsoft Azure Blog
Microsoft Azure Blog
D
Docker
大猫的无限游戏
大猫的无限游戏
Recent Announcements
Recent Announcements
小众软件
小众软件
博客园 - 三生石上(FineUI控件)
B
Blog
酷 壳 – CoolShell
酷 壳 – CoolShell

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Graph calculus and the disconnected-boundary Schwinger-Dy...
Carlos I. Perez-Sanchez · 2018-12-03 · via math.CO updates on arXiv.org

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]$ corresponding to a certain function space $A$ and to the free monoid $G$ in finitely many graph variables; a derivative of an element of $A[G]$ with respect to a graph yields its corresponding group action on $A$. 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.