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

推荐订阅源

Martin Fowler
Martin Fowler
Jina AI
Jina AI
J
Java Code Geeks
Microsoft Security Blog
Microsoft Security Blog
Recent Announcements
Recent Announcements
I
InfoQ
L
LangChain Blog
The Cloudflare Blog
IT之家
IT之家
博客园 - 叶小钗
Apple Machine Learning Research
Apple Machine Learning Research
B
Blog
A
About on SuperTechFans
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Last Week in AI
Last Week in AI
Blog — PlanetScale
Blog — PlanetScale
罗磊的独立博客
云风的 BLOG
云风的 BLOG
Microsoft Azure Blog
Microsoft Azure Blog
Engineering at Meta
Engineering at Meta
F
Fortinet All Blogs
博客园 - 聂微东
美团技术团队
博客园_首页

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}}$
Computing the spectral action for fuzzy geometries: from ...
Carlos I. Perez-Sanchez · 2019-12-31 · via math.CO updates on arXiv.org

A fuzzy geometry is a certain type of spectral triple whose Dirac operator crucially turns out to be a finite matrix. This notion was introduced in [J. Barrett, J. Math. Phys. 56, 082301 (2015)] and accommodates familiar fuzzy spaces like spheres and tori. In the framework of random noncommutative geometry, we use Barrett's characterization of Dirac operators of fuzzy geometries in order to systematically compute the spectral action $S(D)= \mathrm{Tr} f(D)$ for $2n$-dimensional fuzzy geometries. In contrast to the original Chamseddine-Connes spectral action, we take a polynomial $f$ with $f(x)\to \infty$ as $ |x|\to\infty$ in order to obtain a well-defined path integral that can be stated as a random matrix model with action of the type $S(D)=N \cdot \mathrm{tr}\, F+\textstyle\sum_i \mathrm{tr}\,A_i \cdot \mathrm{tr} \,B_i $, being $F,A_i $ and $B_i $ noncommutative polynomials in $2^{2n-1}$ complex $N\times N$ matrices that parametrize the Dirac operator $D$. For arbitrary signature---thus for any admissible KO-dimension---formulas for 2-dimensional fuzzy geometries are given up to a sextic polynomial, and up to a quartic polynomial for 4-dimensional ones, with focus on the octo-matrix models for Lorentzian and Riemannian signatures. The noncommutative polynomials $F,A_i $ and $B_i$ are obtained via chord diagrams and satisfy: independence of $N$; self-adjointness of the main polynomial $F$ (modulo cyclic reordering of each monomial); also up to cyclicity, either self-adjointness or anti-self-adjointness of $A_i $ and $B_i $ simultaneously, for fixed $i$. Collectively, this favors a free probabilistic perspective for the large-$N$ limit we elaborate on.