Power Counting in the Spectral Action Matrix Model

Abstract We derive power counting formulas for ribbon graph amplitudes that were recently independently discovered in two contexts, namely as a generalization of the Kontsevich model, and as corresponding to a matrix model approach to the spectral action. The Feynman rules are based on divided difference functions of eigenvalues of an abstract Dirac operator. We obtain formulas for the order of divergence, depending on the spectral dimension d , the order of decay of the test function f of the spectral action, and the graph properties. Several consequences are discussed, such as the fact that all graphs with maximal order of divergence (at a given loop order and number of external vertices) are planar. To derive our main results we establish two-sided bounds for divided differences, and in particular generalize Hunter’s positivity theorem to a larger class of functions.

Authors

Institutions

Publication Details

Journal
Communications in Mathematical Physics
Published
2026-10-28
DOI
https://doi.org/10.1007/s00220-026-05691-5
Primary Topic
Advanced Operator Algebra Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Power Counting in the Spectral Action Matrix Model

Eva-Maria Hekkelman, Teun D. H. van Nuland
1 links
Communications in Mathematical Physics
Advanced Operator Algebra Research
article

Power Counting in the Spectral Action Matrix Model

Eva-Maria Hekkelman, Teun D. H. van Nuland
article en

Abstract

Abstract We derive power counting formulas for ribbon graph amplitudes that were recently independently discovered in two contexts, namely as a generalization of the Kontsevich model, and as corresponding to a matrix model approach to the spectral action. The Feynman rules are based on divided difference functions of eigenvalues of an abstract Dirac operator. We obtain formulas for the order of divergence, depending on the spectral dimension d , the order of decay of the test function f of the spectral action, and the graph properties. Several consequences are discussed, such as the fact that all graphs with maximal order of divergence (at a given loop order and number of external vertices) are planar. To derive our main results we establish two-sided bounds for divided differences, and in particular generalize Hunter’s positivity theorem to a larger class of functions.

Communications in Mathematical PhysicsVol. 407(12)
Max Planck Institute for Mathematics (DE), Delft University of Technology (NL)
Nederlandse Organisatie voor Wetenschappelijk Onderzoek
Openalex Percentile: Top 83%
Advanced Operator Algebra Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon