Related papers: Constructive Field Theory in Zero Dimension
In this paper, we consider the problem of reconstructing a directed graph using path queries. In this query model of learning, a graph is hidden from the learner, and the learner can access information about it with path queries. For a…
We revisit scalar $\phi^4$ theory and construct a reorganized perturbative expansion in which the kinetic operator, rather than the quartic interaction, is treated as the perturbation. Starting from the exactly solvable $0$-dimensional…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
This paper is concerned with constructive and structural aspects of euclidean field theory. We present a C*-algebraic approach to lattice field theory. Concepts like block spin transformations, action, effective action, and continuum limits…
The slope variety of a graph is an algebraic set whose points correspond to drawings of a graph. A complement-reducible graph (or cograph) is a graph without an induced four-vertex path. We construct a bijection between the zeroes of the…
We give an introduction to constructive category theory by answering two guiding computational questions. The first question is: how do we compute the set of all natural transformations between two finitely presented functors like…
We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…
We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its…
An effective formalism for white noise analysis, conceptually equivalent to Wilsonian renormalization theory, is introduced. Space-time gets represented by a boolean lattice of coarse regions, energy scales become space-time partitions by…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
A certain topological field theory is shown to be equivalent to the compactified c=1 string. This theory is described in both Kazama-Suzuki coset and Landau-Ginzburg formulations. The genus-g partition function and genus-0 multi-tachyon…
The subject of matrix field theory involves matrix models, noncommutative geometry, fuzzy physics and noncommutative field theory and their interplay. In these lectures, a lot of emphasis is placed on the matrix formulation of…
In this review article, we review the recent developments in constructing string field theories that have been proposed, all of which correctly reproduce the correlation functions of two-dimensional string theory. These include: (a) free…
In this paper, some special distance spectral properties of graphs are considered. Concretely, we recursively construct an infinite family of trees with distance eigenvalue $-1$, and determine all $\{C_3,C_4\}$-free connected graphs with…
Explicit expressions are considered for the generating functions concerning the number of planar diagrams with given numbers of 3- and 4-point vertices. It is observed that planar renormalization theory requires diagrams with restrictions,…
Various effective field theories in four dimensions are shown to have exact non-trivial solutions in the limit as the number $N$ of fields of some type becomes large. These include extended versions of the U(N) Gross-Neveu model, the…
We study a problem of reconstruction of connected graphs where the input gives all subsets of size k that induce a connected subgraph. Originally introduced by Bastide et al. (WG 2023) for triples ($k=3$), this problem received…
We examine several resummation methods for computing higher order corrections to the finite temperature effective potential, in the context of a scalar $\phi^4$ theory. We show by explicit calculation to four loops that dressing the…
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of these diagrams is that edges need not be connected to…
We discuss resummation strategies for free energy in quantum field theories at nonzero temperatures T. We point out that resummations should be performed for the short- and long-distance parts separately in order to avoid spurious…