Skip to content
Off-topic for aiqbench

Off-topic for aiqbench

This story was gathered from a source we follow but falls outside AI and quantum coverage, so there is no aiqbench take for it.

An exact algorithm for U(N) matrix models in the gauge-invariant singlet sector

arXiv3 min read

arXiv:2607.13725v2 Announce Type: replace-cross Abstract: Matrix models appear as fundamental descriptions of M-theory and D-brane dynamics, and via the gauge/gravity duality their gauge-invariant, or singlet, sector describes the purely gravitational degrees of freedom in the holographic dual. We present a new exact algorithm for computing observables of bosonic U(N) matrix models in the gauge-invariant singlet sector. This sector is spanned by an orthogonal basis of Schur polynomials (for a single matrix) and restricted Schur polynomials (for multiple matrices), which diagonalizes the free Hamiltonian and provides a natural truncation of the Hilbert space by excitation number. Matrix elements of the interaction Hamiltonian, or any gauge-invariant observable, are evaluated through a group-theoretic reduction to cosets and double cosets of suitable subgroups of the symmetric group, together with character sums on the symmetric group. The resulting entries are closed-form polynomials in the gauge-group rank N, assembled from group-theoretic data that are precomputed once and can be reused for any N and any coupling constants. We validate the one-matrix implementation against the exact mapping to N non-interacting fermions, demonstrating rapid convergence of the low-lying spectrum with the cutoff. The multi-matrix extension is outlined; its main bottleneck is the computation of restricted characters of the symmetric group, for which no algorithm comparable to the Murnaghan--Nakayama rule is currently known. The framework gives direct access to finite-N, finite-coupling dynamics of gauge-invariant states and opens a new computational window on the non-planar regime of holographic matrix models.

Abstract:Matrix models appear as fundamental descriptions of M-theory and D-brane dynamics, and via the gauge/gravity duality their gauge-invariant, or singlet, sector describes the purely gravitational degrees of freedom in the holographic dual. We present a new exact algorithm for computing observables of bosonic U(N) matrix models in the gauge-invariant singlet sector. This sector is spanned by an orthogonal basis of Schur polynomials (for a single matrix) and restricted Schur polynomials (for multiple matrices), which diagonalizes the free Hamiltonian and provides a natural truncation of the Hilbert space by excitation number. Matrix elements of the interaction Hamiltonian, or any gauge-invariant observable, are evaluated through a group-theoretic reduction to cosets and double cosets of suitable subgroups of the symmetric group, together with character sums on the symmetric group. The resulting entries are closed-form polynomials in the gauge-group rank N, assembled from group-theoretic data that are precomputed once and can be reused for any N and any coupling constants. We validate the one-matrix implementation against the exact mapping to N non-interacting fermions, demonstrating rapid convergence of the low-lying spectrum with the cutoff. The multi-matrix extension is outlined; its main bottleneck is the computation of restricted characters of the symmetric group, for which no algorithm comparable to the Murnaghan--Nakayama rule is currently known. The framework gives direct access to finite-N, finite-coupling dynamics of gauge-invariant states and opens a new computational window on the non-planar regime of holographic matrix models.

60 pages, added references for section 3.2

arXiv:2607.13725 [hep-th]

(or arXiv:2607.13725v2 [hep-th] for this version)

https://doi.org/10.48550/arXiv.2607.13725 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 331 words

Related coverage