Skip to content
#edge computing Open access

The sum nobody bounded: an optimal 15j inequality, a directional decay law, and the one direction in which absolute majorants fail for the Lorentzian EPRL vertex

Sep 2026 · Zenodo (CERN European Organization for Nuclear Research)
Noncommutative and Quantum Gravity Theories

Abstract

Every Lorentzian spinfoam amplitude computed numerically truncates the sum over virtual SU(2) spins l_f >= j_f at a shell depth Delta l; the convergence of that sum has not been proved. This paper bounds the sum by the direct absolute-value route and reports how far it reaches. (1) For the first-kind 15j symbol of the vertex assembly we prove |15j| <= J, a closed form in the fifteen labels, with constant 1 proved optimal (saturated at a doubled-label tuple where both sides equal sqrt(3)/6). (2) Assembling J with rigorous booster envelopes under one shared rapidity, and under the explicit hypothesis that the internal 15j label and the four auxiliary intertwiners carry no growth rate, we derive an exact direction-resolved decay law for the envelope: coordinate directions decay with exponent at least 17/6, the law is piecewise affine on a 13-hyperplane arrangement (7,377 cells), and the envelope fails to be summable on a proper subcone around the isotropic diagonal with maximal deficit 7/18. (3) Over every choice the construction admits (1,458 members per booster) the best achievable exponent coincides with the realized one. VERSION 2 CORRECTS THE SCOPE OF (2)-(3): the auxiliary intertwiners have key-bounded cardinality but their values track the shell, so the decay law describes the envelope under the stated hypothesis and not the vertex tail; on the tail's actual support the absolute route fails by more than stated (crude exponent at the isotropic point at most -1/3 rather than 11/3), and the summand is supported only on the cone where, at each edge, the largest virtual spin is matched by at least one other. Theorem 1 is unaffected. All results are exact rational or symbolic statements at the stock convention rho = gamma (j+1), gamma = 6/5.

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.