Search arXivSearch

arXiv · 2312.00056

Combinatorial decompositions for deformed or decorated classes of maps

Abstract

The perturbative expansion of tensorial field theories in Feynman graphs can be interpreted as weighted generating series of some piecewise linear varieties. This simple fact establishes a link between two a priori distinct fields: the combinatorics of discrete manifolds on one hand and tensorial field theories on the other hand. In this thesis, we study different aspects revolving around this connection between combinatorics and field theory. First, we consider constellations model, which generalize maps and their algebraic properties. This makes them suited to probe the b-deformation, a deformation of the algebra of symmetric functions. We will study the constraints satisfied by the generating series of cubical b-deformed constellations. Second, we analyze the double scaling limit of particular tensor models of order 3. For tensor of order greater than two, the nature of the 1/N-expansion is qualitatively different from the matrix case of order 2. In particular, only the leading order graphs are fully characterized. Despite this fact, it is possible to identify graphs of subleading orders contributing to the double scaling limit by implementing the scheme decomposition for Feynman graphs of these theories. An analysis of the singularity of the schemes then allows us to give a complete characterization of the graphs contributing to the double scaling limit. Finally, we investigate a particular link between a tensor and a vector field theory which both admit a melonic limit. Namely, we will show that we can obtain the vectorial Amit-Roginski model by considering perturbations around a classical solution of the Boulatov model, a tensorial theory. We give sufficient conditions on the classical solution so that the effective action for the perturbation around this solution takes the form of the Amit-Roginski action.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victor Nador. 2023-11-29. Combinatorial decompositions for deformed or decorated classes of maps. https://arxiv.org/abs/2312.00056

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO