arXiv subjects

Matilde Marcolli

Publications and source records attributed to Matilde Marcolli.

At least 55 records · Page 3Linked to original sources

arXiv2020

Bost-Connes systems and F1-structures in Grothendieck rings, spectra, and Nori motives

We construct geometric lifts of the Bost-Connes algebra to Grothendieck rings and to the associated assembler categories and spectra, as well as to certain categories of Nori motives. These categorifications are related to the integral Bost-Connes algebra via suitable Euler characteristic type maps and zeta functions, and in the motivic case via fiber functors. We also discuss aspects of F1-geometry, in the framework of torifications, that fit into this general setting.

math.AG↗

arXiv2020

Motives of melonic graphs

We investigate recursive relations for the Grothendieck classes of the affine graph hypersurface complements of melonic graphs. We compute these classes explicitly for several families of melonic graphs, focusing on the case of graphs with valence-$4$ internal vertices, relevant to CTKT tensor models. The results hint at a complex and interesting structure, in terms of divisibility relations or nontrivial relations between classes of graphs in different families. Using the recursive relations we prove that the Grothendieck classes of all melonic graphs are positive as polynomials in the class of the moduli space $\mathcal M_{0,4}$. We also conjecture that the corresponding polynomials are log-concave, on the basis of hundreds of explicit computations.

math.AG↗

arXiv2020

Dessins for Modular Operad and Grothendieck-Teichmuller Group

A part of Grothendieck's program for studying the Galois group $G_{\mathbb Q}$ of the field of all algebraic numbers $\overline{\mathbb Q}$ emerged from his insight that one should lift its action upon $\overline{\mathbb Q}$ to the action of $G_{\mathbb Q}$ upon the (appropriately defined) profinite completion of $π_1({\mathbb P}^1 \setminus \{0,1, \infty\})$. The latter admits a good combinatorial encoding via finite graphs "dessins d'enfant". This part was actively developing during the last decades, starting with foundational works of A. Belyi, V. Drinfeld and Y. Ihara. Our brief note concerns another part of Grothendieck program, in which its geometric environment is extended to moduli spaces of algebraic curves, more specifically, stable curves of genus zero with marked/labelled points. Our main goal is to show that dual graphs of such curves may play the role of "modular dessins" in an appropriate operadic context.

math.AG↗

arXiv2020

Quantum Statistical Mechanics of the Absolute Galois Group

We present possible extensions of the quantum statistical mechanical formulation of class field theory to the non-abelian case, based on the action of the absolute Galois group on Grothendieck's dessins d'enfant, the embedding in the Grothendieck-Teichmüller group, and the Drinfeld-Ihara involution.

math.AG↗

arXiv2019

Nori diagrams and persistent homology

Recently, it was found that there is a remarkable intuitive similarity between studies in theoretical computer science dealing with large data sets on the one hand, and categorical methods of topology and geometry in pure mathematics, on the other. In this article, we treat the key notion of persistency from computer science in the algebraic geometric context involving Nori motivic constructions and related methods. We also discuss model structures for persistent topology.

math.AG↗

arXiv2019

Phylogenetics of Indo-European Language families via an Algebro-Geometric Analysis of their Syntactic Structures

Using Phylogenetic Algebraic Geometry, we analyze computationally the phylogenetic tree of subfamilies of the Indo-European language family, using data of syntactic structures. The two main sources of syntactic data are the SSWL database and Longobardi's recent data of syntactic parameters. We compute phylogenetic invariants and likelihood functions for two sets of Germanic languages, a set of Romance languages, a set of Slavic languages and a set of early Indo-European languages, and we compare the results with what is known through historical linguistics.

cs.CL↗

arXiv2019

Topological Analysis of Syntactic Structures

We use the persistent homology method of topological data analysis and dimensional analysis techniques to study data of syntactic structures of world languages. We analyze relations between syntactic parameters in terms of dimensionality, of hierarchical clustering structures, and of non-trivial loops. We show there are relations that hold across language families and additional relations that are family-specific. We then analyze the trees describing the merging structure of persistent connected components for languages in different language families and we show that they partly correlate to historical phylogenetic trees but with significant differences. We also show the existence of interesting non-trivial persistent first homology groups in various language families. We give examples where explicit generators for the persistent first homology can be identified, some of which appear to correspond to homoplasy phenomena, while others may have an explanation in terms of historical linguistics, corresponding to known cases of syntactic borrowing across different language subfamilies.

cs.CL↗

arXiv2018

Nonarchimedean Holographic Entropy from Networks of Perfect Tensors

We consider a class of holographic quantum error-correcting codes, built from perfect tensors in network configurations dual to Bruhat-Tits trees and their quotients by Schottky groups corresponding to BTZ black holes. The resulting holographic states can be constructed in the limit of infinite network size. We obtain a $p$-adic version of entropy which obeys a Ryu-Takayanagi like formula for bipartite entanglement of connected or disconnected regions, in both genus-zero and genus-one $p$-adic backgrounds, along with a Bekenstein-Hawking-type formula for black hole entropy. We prove entropy inequalities obeyed by such tensor networks, such as subadditivity, strong subadditivity, and monogamy of mutual information (which is always saturated). In addition, we construct infinite classes of perfect tensors directly from semiclassical states in phase spaces over finite fields, generalizing the CRSS algorithm, and give Hamiltonians exhibiting these as vacua.

hep-th↗

arXiv2018

Bell polynomials and Brownian bridge in Spectral Gravity models on multifractal Robertson-Walker cosmologies

We obtain an explicit formula for the full expansion of the spectral action on Robertson-Walker spacetimes, expressed in terms of Bell polynomials, using Brownian bridge integrals and the Feynman-Kac formula. We then apply this result to the case of multifractal Packed Swiss Cheese Cosmology models obtained from an arrangement of Robertson-Walker spacetimes along an Apollonian sphere packing. Using Mellin transforms, we show that the asymptotic expansion of the spectral action contains the same terms as in the case of a single Robertson-Walker spacetime, but with zeta-regularized coefficients, given by values at integers of the zeta function of the fractal string of the radii of the sphere packing, as well as additional log-periodic correction terms arising from the poles (off the real line) of this zeta function.

math-ph↗

arXiv2018

Homotopy types and geometries below Spec Z

After the first heuristic ideas about `the field of one element' F_1 and `geometry in characteristics 1' (J.~Tits, C.~Deninger, M.~Kapranov, A.~Smirnov et al.), there were developed several general approaches to the construction of `geometries below Spec Z'. Homotopy theory and the `the brave new algebra' were taking more and more important places in these developments, systematically explored by B.~Toën and M.~Vaquié, among others. This article contains a brief survey and some new results on counting problems in this context, including various approaches to zeta--functions and generalised scissors congruences. The new version includes considerable extensions and revisions suggested by I. Zakharevich.

math.AG↗

arXiv2018

Gamma Spaces and Information

We investigate the role of Segal's Gamma-spaces in the context of classical and quantum information, based on categories of finite probabilities with stochastic maps and density matrices with quantum channels. The information loss functional extends to the setting of probabilistic Gamma-spaces considered here. The Segal construction of connective spectra from Gamma-spaces can be used in this setting to obtain spectra associated to certain categories of gapped systems.

cs.IT↗

arXiv2018

Heat Kernel analysis of Syntactic Structures

We consider two different data sets of syntactic parameters and we discuss how to detect relations between parameters through a heat kernel method developed by Belkin-Niyogi, which produces low dimensional representations of the data, based on Laplace eigenfunctions, that preserve neighborhood information. We analyze the different connectivity and clustering structures that arise in the two datasets, and the regions of maximal variance in the two-parameter space of the Belkin-Niyogi construction, which identify preferable choices of independent variables. We compute clustering coefficients and their variance.

cs.CL↗

arXiv2018

Holographic Codes on Bruhat--Tits buildings and Drinfeld Symmetric Spaces

This paper is based on the author's talk at the Arbeitstagung 2017. It discusses some general approaches to the construction of classical and quantum holographic codes on Bruhat-Tits trees and buildings and on Drinfeld symmetric spaces, in the context of the p-adic AdS/CFT correspondence.

math-ph↗

arXiv2018

Asymptotic bounds for spherical codes

The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The central problem of the theory of such codes consists in maximizing simultaneously the transmission rate of the code and the relative minimum Hamming distance between two different code words. The classical approach to this problem explored in vast literature consists in the inventing explicit constructions of "good codes" and comparing new classes of codes with earlier ones. Less classical approach studies the geometry of the whole set of code points (R,delta) (with q fixed), at first independently of its computability properties, and only afterwords turning to the problems of computability, analogies with statistical physics etc. The main purpose of this article consists in extending this latter strategy to domain of spherical codes.

cs.IT↗

arXiv2017

Motivic Information

We introduce notions of information/entropy and information loss associated to exponentiable motivic measures. We show that they satisfy appropriate analogs to the Khinchin-type properties that characterize information loss in the context of measures on finite sets.

math-ph↗

arXiv2017

Motives and periods in Bianchi IX gravity models

We show that, when considering the anisotropic scaling factors and their derivatives as affine variables, the coefficients of the heat kernel expansion of the Dirac-Laplacian on $SU(2)$ Bianchi IX metrics are algebro-geometric periods of motives of complements in affine spaces of unions of quadrics and hyperplanes. We show that the motives are mixed Tate and we provide an explicit computation of their Grothendieck classes.

math-ph↗

arXiv2017

Anyons in Geometric Models of Matter

We show that the "geometric models of matter" approach proposed by the first author can be used to construct models of anyon quasiparticles with fractional quantum numbers, using 4-dimensional edge-cone orbifold geometries with orbifold singularities along embedded 2-dimensional surfaces. The anyon states arise through the braid representation of surface braids wrapped around the orbifold singularities, coming from multisections of the orbifold normal bundle of the embedded surface. We show that the resulting braid representations can give rise to a universal quantum computer.

math-ph↗

arXiv2017

Tensor networks, $p$-adic fields, and algebraic curves: arithmetic and the AdS$_3$/CFT$_2$ correspondence

One of the many remarkable properties of conformal field theory in two dimensions is its connection to algebraic geometry. Since every compact Riemann surface is a projective algebraic curve, many constructions of interest in physics (which a priori depend on the analytic structure of the spacetime) can be formulated in purely algebraic language. This opens the door to interesting generalizations, obtained by taking another choice of field: for instance, the $p$-adics. We generalize the AdS/CFT correspondence according to this principle; the result is a formulation of holography in which the bulk geometry is discrete---the Bruhat--Tits tree for $\mathrm{PGL}(2,\mathbb{Q}_p)$---but the group of bulk isometries nonetheless agrees with that of boundary conformal transformations and is not broken by discretization. We suggest that this forms the natural geometric setting for tensor networks that have been proposed as models of bulk reconstruction via quantum error correcting codes; in certain cases, geodesics in the Bruhat--Tits tree reproduce those constructed using quantum error correction. Other aspects of holography also hold: Standard holographic results for massive free scalar fields in a fixed background carry over to the tree, whose vertical direction can be interpreted as a renormalization-group scale for modes in the boundary CFT. Higher-genus bulk geometries (the BTZ black hole and its generalizations) can be understood straightforwardly in our setting, and the Ryu-Takayanagi formula for the entanglement entropy appears naturally.

hep-th↗