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

推荐订阅源

U
Unit 42
The Cloudflare Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Y
Y Combinator Blog
G
Google Developers Blog
Vercel News
Vercel News
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Jina AI
Jina AI
Blog — PlanetScale
Blog — PlanetScale
H
Help Net Security
博客园 - 三生石上(FineUI控件)
MongoDB | Blog
MongoDB | Blog
S
SegmentFault 最新的问题
阮一峰的网络日志
阮一峰的网络日志
H
Hackread – Cybersecurity News, Data Breaches, AI and More
aimingoo的专栏
aimingoo的专栏
T
Tailwind CSS Blog
博客园 - 叶小钗
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
月光博客
月光博客
Microsoft Security Blog
Microsoft Security Blog
P
Proofpoint News Feed
The GitHub Blog
The GitHub Blog
云风的 BLOG
云风的 BLOG

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}}$
The Asymptotic Structure of Cosmological Integrals
Paolo Benincasa, Francisco Vazão · 2024-02-10 · via math.CO updates on arXiv.org

We provide a general analysis of the asymptotic behaviour of perturbative contributions to observables in arbitrary power-law FRW cosmologies, indistinctly the Bunch-Davies wavefunction and cosmological correlators. We consider a large class of scalar toy models, including conformally-coupled and massless scalars in arbitrary dimensions, that admits a first principle definition in terms of (generalised/weighted) cosmological polytopes. The perturbative contributions to an observable can be expressed as an integral of the canonical function associated to such polytopes and to weighted graphs. We show how the asymptotic behaviour of these integrals is governed by a special class of nestohedra living in the graph-weight space, both at tree and loop level. As the singularities of a cosmological process described by a graph can be associated to its subgraphs, we provide a realisation of the nestohedra as a sequential truncation of a top-dimensional simplex based on the underlying graph. This allows us to determine all the possible directions -- both in the infrared and in the ultraviolet --, where the integral can diverge as well as their divergence degree. Both of them are associated to the facets of the nestohedra, which are identified by overlapping tubings of the graph: the specific tubing determines the divergent directions while the number of overlapping tubings its degree of divergence. This combinatorial formulation makes straightforward the application of sector decomposition for extracting both leading and subleading divergences from the integral, as the sectors in which the integration domain can be tiled are identified by the collection of compatible facets of the nestohedra, with the latter that can be determined via the graph tubings. Finally, the leading divergence can be interpreted as a restriction of the canonical function of the relevant polytope onto a special hyperplane.