arXiv subjects

Sanjaye Ramgoolam

Publications and source records attributed to Sanjaye Ramgoolam.

At least 19 recordsLinked to original sources

arXiv2026

String theory mathematics and matrix data analysis

Inspired by matrix techniques in quantum field theory and string theory, we review Permutation Invariant Gaussian Matrix Models (PIGMM), which replace the continuous symmetries of traditional Random Matrix Theory, for $ N \times N$ matrices, with finite permutation symmetry, $S_N$. This symmetry-driven approach reduces highly multivariate $N^2$-variable matrix data analysis problems to a rich but tractable space of parameters. The representation theory of $S_N$ brings a highly correlated quadratic matrix action to a near-diagonal form with $13$ parameters. The invariant observables are parameterised by graphs and their expectation values are computed with Wick contractions implemented algorithmically. We review the successful application of PIGMM for data reduction and anomaly detection in computational linguistics, statistical finance and neural network weights. We conclude with a brief discussion of potential future applications to matrix data analysis tasks that exploit hadronization algorithms and the modular structure of collider-physics data.

hep-th↗

arXiv2026

Negative heat capacities in spherically symmetric sectors of $d$-matrix quantum mechanics

We consider the $SO(d)$ and $O(d)$ invariant sectors of the bosonic $d$-matrix harmonic oscillator with $U(N)$ gauge symmetry. The micro-canonical degeneracy $\mathcal{Z}( N , d , k )$ for fixed energy $k$ is expressed as a pairing between an $N$-dependent vector and a $d$-dependent vector in the space of partitions of the integer $k$. This pairing formula is derived by counting invariant words in multi-matrix variables $X^i_{j,a}$, using properties of Clebsch-Gordan multiplicities (Kronecker coefficients) for the symmetric group $S_k$, Schur-Weyl duality and harmonic analysis on the homogeneous space $U(d)/SO(d)$. Analytic formulae for large $N$ and $k$ with $ k \le N $ are obtained using group integrals over $U(N)$ and $SO(d)$ (or $ O(d)$). The micro-canonical heat capacity in this regime is negative and turns positive, at a critical value $k_{\rm crit}$, due to finite $N$ modifications to the counting, thus forming what we denote as a characteristic caloric fold in the $ E $ versus $T$ curve. Data from the pairing formula is well fitted by $k_{\rm crit} \sim { N^2 \over 4 }$ for small values of $d$. A derivation of this large $N$ formula is given using a matrix model approximation and semi-classical analysis of the eigenvalue density. The large $N,d$ limit of the degeneracies reveals a key role for ribbon graph combinatorics. The caloric fold is also notably a property of black hole thermodynamics in anti-de-Sitter spaces. We propose the spherically symmetric $SO(d)$ and $O(d)$ invariant sectors of $d$-matrix quantum mechanics as tractable matrix systems for capturing key features of dual descriptions of black-hole thermodynamics.

hep-th↗

arXiv2026

Oscillators from non-semisimple walled Brauer algebras

The walled Brauer algebras $B_N(m,n)$ govern Schur--Weyl duality for unitary groups $U(N)$ acting on mixed tensor spaces $V_N^{\otimes m}\otimes \overline{V}_N^{\otimes n}$ and play an important role in applications ranging from AdS/CFT to quantum information theory. In the stable regime $N\ge m+n$ the algebra is semisimple and its representation theory is well understood. For $N<m+n$, however, $B_N(m,n)$ becomes non-semisimple. The representation of the algebra on tensor space has a non-trivial kernel and the corresponding quotient algebra is semisimple, with representation dimensions differing from those in the stable regime. We introduce \emph{restricted Bratteli diagrams}, obtained by modifying the standard Bratteli diagrams for $B_N(m,n)$. This construction provides a systematic way to use representation-theoretic data from the stable regime to compute the dimension modifications arising in the non-semisimple regime. In the regime $N=m+n-l$, with $l$ small compared to $m,n$, we show that the restricted diagrams exhibit a stability property and enable an efficient counting of the paths responsible for these dimension corrections. Remarkably, the resulting generating functions are governed by the partition function of an infinite tower of simple harmonic oscillators. We briefly discuss implications for the construction of orthogonal bases of matrix invariants in gauge theory and related applications in quantum information theory.

hep-th↗

arXiv2026

Critical dimensions and small cycle dominance from all-orders asymptotics of $d$-matrix theory

Supersymmetric sectors of $\mathcal{N}=4$ super-Yang-Mills theory motivate the study of the partition function for the counting of gauge-invariant functions of $d=2,3$ matrices transforming under the adjoint action of $U(N)$. The partition function $ \mathcal{Z}_d ( x) $ in the large $N$ limit has a known Hagedorn phase transition at $ x = d^{-1} $ which provides a simple model for the phase structure of the thermal partition function of SYM. We study the all-orders asymptotic expansion of $ \mathcal{Z}_d(x)$ based on a geometric picture of concentric circles of poles in the complex plane accumulating in a natural boundary at $|x| =1$. We find that the order by order structure has a precise combinatorial interpretation organized in terms of increasing cycle size of permutations arising in the enumeration of the invariants. We refer to this organization as small-cycle dominance, and find that it extends to refined versions of the partition functions depending on several complex variables. An analysis of the coefficients in the asymptotic expansion of $ \mathcal{Z}_d(x) $ using the modular property of the Dedekind eta function reveals that the asymptotic expansion is actually convergent for $d\ge d_{ \rm crit } = 13$. A fermionic version of $\mathcal{Z}_d (x)$ has an analogous critical dimension of $ d_{ \rm crit} = 7$. This distinction indicates that the partition functions of the matrix models can be completely reconstructed from their high-energy (UV) limit for $d\ge d_{ \rm crit}$ whereas additional input is required to reconstruct the exact coefficients of the low-energy (IR) expansion for $2\le d \le d_{ \rm crit } -1 $.

hep-th↗

arXiv2026

Gauge-string duality, monomial bases and graph determinants

Questions at the intersection of the AdS/CFT correspondence and quantum information theory motivate the study of projectors in sequences of subalgebras of finite-dimensional commutative associative semisimple algebras $\mathcal{A}$, obtained by incrementally adjoining one generator at each step to produce a non-linear generating set for $\mathcal{A}$. We define degeneracy graphs, which are finite layered tree graphs whose nodes represent projectors in the successive subalgebras. Using combinatorial properties of the degeneracy graph, we give a simple formula for constructing a linear basis of $\mathcal{A}$ in terms of monomials in the generators. The nodes can be labelled by formal variables corresponding to the eigenvalues of the generators added at each layer. We prove that the construction is compatible with the required counting of projectors in $\mathcal{A}$, and give explicit constructions of the projectors in terms of the monomials, in the cases of one- and two-layer degeneracy graphs with arbitrary numbers of nodes. More generally, we provide extensive computational evidence for the invertibility of the matrix relating the proposed monomial basis to the projector basis, by evaluating its determinant. In the 1-layer case, this is a Vandermonde determinant. A simple formula for the non-vanishing determinant in the general layer case is conjectured and supported by the computational data. The construction is illustrated with examples including centres of symmetric group algebras and maximally commuting subalgebras generated by JucysMurphy elements. We outline applications of the monomial basis to algorithms for constructing matrix units in non-commutative semisimple algebras, with relevance to orthogonal bases of multi-matrix gauge-invariant operators and to quantum information theory.

hep-th↗

arXiv2026

Finite-dimensional algebras, gauge-string duality and thermodynamics

Gauge-invariant polynomial functions of matrix and tensor variables capture combinatorial structures of gauge-string duality, which can be usefully organised using finite-dimensional associative algebras. I review recent work on eigenvalue systems using these algebras as state spaces, which provide efficient computational algorithms for the construction of orthogonal bases in the multi-matrix case. Algebraic counting formulae in matrix and tensor systems with $U(N)$ as well as $S_N$ symmetry have led to gauged quantum mechanical models which display a negative branch of specific heat capacity in the micro-canonical ensemble followed by positive specific heat capacity at larger energies measured by a polynomial degree parameter $n$. The negative branch is associated with near-exponential or factorial growth of degeneracies for $ n \gg 1$ in a region of large $N$ stability, while the positive branch occurs when the finite $N$ reduction of degrees of freedom takes over as $n$ becomes sufficiently large compared to $N$.

hep-th↗

arXiv2025

Approximate Gaussianity Beyond Initialisation in Neural Networks

Ensembles of neural network weight matrices are studied through the training process for the MNIST classification problem, testing the efficacy of matrix models for representing their distributions, under assumptions of Gaussianity and permutation-symmetry. The general 13-parameter permutation invariant Gaussian matrix models are found to be effective models for the correlated Gaussianity in the weight matrices, beyond the range of applicability of the simple Gaussian with independent identically distributed matrix variables, and notably well beyond the initialisation step. The representation theoretic model parameters, and the graph-theoretic characterisation of the permutation invariant matrix observables give an interpretable framework for the best-fit model and for small departures from Gaussianity. Additionally, the Wasserstein distance is calculated for this class of models and used to quantify the movement of the distributions over training. Throughout the work, the effects of varied initialisation regimes, regularisation, layer depth, and layer width are tested for this formalism, identifying limits where particular departures from Gaussianity are enhanced and how more general, yet still highly-interpretable, models can be developed.

cs.LG↗

arXiv2025

Simple harmonic oscillators from non-semisimple walled Brauer algebras

Walled Brauer algebras $B_N ( m , n ) $ illuminate the combinatorics of mixed tensor representations of $U(N)$, with $m$ copies of the fundamental and $n$ copies of the anti-fundamental representation. They lie at the intersection of research in representation theory, AdS/CFT and quantum information theory. They have been used to study of correlators in multi-matrix models motivated by brane-anti-brane physics in AdS/CFT. They have been applied in computing and optimising fidelities of port-based quantum teleportation. There is a large $N$ regime, specifically $ N \ge (m+n)$ where the algebras are semi-simple and their representation theory more tractable. There are known combinatorial formulae for dimensions of irreducible representations and associated reduction multiplicities. The large $N$ regime has a stability property whereby these formulae are independent of $N$. In this paper we initiate a systematic study of the combinatorics in the non-semisimple regime of $ N = m +n - l $, with positive $l$. We introduce restricted Bratteli diagrams (RBD) which are useful as an instrument to process known data from the large $N$ regime to calculate representation theory data in the non-semisimple regime. We identify within the non-semisimple regime, a region of $(m,n)$-stability, where $ \min ( m, n ) \ge ( 2l -3) $ and the RBD take a stable form depending on $l$ only and not the choice of $ m,n$ within the region. In this regime, several aspects of the combinatorics of the RBD are controlled by a universal partition function for an infinite tower of simple harmonic oscillators closely related, but not identical, to the partition function of 2D non-chiral free scalar field theory.

hep-th↗

arXiv2025

Gauged permutation invariant tensor quantum mechanics, least common multiples and the inclusion-exclusion principle

We derive the canonical ensemble partition functions for gauged permutation invariant tensor quantum harmonic oscillator thermodynamics, finding surprisingly simple expressions with number-theoretic characteristics. These systems have a gauged symmetry of $S_N$, the symmetric group of all permutations of a set of $N$ objects. The symmetric group acts on tensor variables $ \Phi_{ i_1, \cdots , i_s } $, where the $s$ indices each range over $ \{ 1, 2, \cdots , N \} $ and have the standard $S_N$ action of permutations. The result is a sum over partitions of $N$ and the summand is a product admitting simple expressions, which depend on the least common multiples (LCMs) of subsets of the parts of the partition. The inclusion-exclusion principle of combinatorics plays a central role in the derivation of these expressions. The behaviour of these partition functions under inversion of the Boltzmann factor $ x = e^{ - \beta } $ is governed by universal sequences associated with invariants of symmetric groups and alternating groups. The partition functions allow the development of a high temperature expansion analogous to the $s=2$ matrix case. The calculation of an $s$-dependent breakdown point leads to a critical Boltzmann factor $ x_c = { \log N \over sN^{ s-1}}$ as the leading large $N$ approximation.

hep-th↗

arXiv2025

Row and column detection complexities of character tables

Character tables of finite groups and closely related commutative algebras have been investigated recently using new perspectives arising from the AdS/CFT correspondence and low-dimensional topological quantum field theories. Two important elements in these new perspectives are physically motivated definitions of quantum complexity for the algebras and a notion of row-column duality. These elements are encoded in properties of the character table of a group G and the associated algebras, notably the centre of the group algebra and the fusion algebra of irreducible representations of the group. Motivated by these developments, we define row and column versions of detection complexities for character tables, and investigate the relation between these complexities under the exchange of rows and columns. We observe regularities that arise in the statistical averages over small character tables and propose corresponding conjectures for arbitrarily large character tables.

hep-th↗

arXiv2024

Eigenvalue systems for integer orthogonal bases of multi-matrix invariants at finite N

Multi-matrix invariants, and in particular the scalar multi-trace operators of $\mathcal{N}=4$ SYM with $U(N)$ gauge symmetry, can be described using permutation centraliser algebras (PCA), which are generalisations of the symmetric group algebras and independent of $N$. Free-field two-point functions define an $N$-dependent inner product on the PCA, and bases of operators have been constructed which are orthogonal at finite $N$. Two such bases are well-known, the restricted Schur and covariant bases, and both definitions involve representation-theoretic quantities such as Young diagram labels, multiplicity labels, branching and Clebsch-Gordan coefficients for symmetric groups. The explicit computation of these coefficients grows rapidly in complexity as the operator length increases. We develop a new method for explicitly constructing all the operators with specified Young diagram labels, based on an $N$-independent integer eigensystem formulated in the PCA. The eigensystem construction naturally leads to orthogonal basis elements which are integer linear combinations of the multi-trace operators, and the $N$-dependence of their norms are simple known dimension factors. We provide examples and give computer codes in SageMath which efficiently implement the construction for operators of classical dimension up to 14. While the restricted Schur basis relies on the Artin-Wedderburn decomposition of symmetric group algebras, the covariant basis relies on a variant which we refer to as the Kronecker decomposition. Analogous decompositions exist for any finite group algebra and the eigenvalue construction of integer orthogonal bases extends to the group algebra of any finite group with rational characters.

hep-th↗

arXiv2024

Counting of surfaces and computational complexity in column sums of symmetric group character tables

The character table of the symmetric group $S_n$, of permutations of $n$ objects, is of fundamental interest in theoretical physics, combinatorics as well as computational complexity theory. We investigate the implications of an identity, which has a geometrical interpretation in combinatorial topological field theories, relating the column sum of normalised central characters of $S_n$ to a sum of structure constants of multiplication in the centre of the group algebra of $S_n$. The identity leads to the proof that a combinatorial computation of the column sum belongs to complexity class \shP. The sum of structure constants has an interpretation in terms of the counting of branched covers of the sphere. This allows the identification of a tractable subset of the structure constants related to genus zero covers. We use this subset to prove that the column sum for a conjugacy class labelled by partition $\lambda$ is non-vanishing if and only if the permutations in the conjugacy class are even. This leads to the result that the determination of the vanishing or otherwise of the column sum is in complexity class \pP. The subset gives a positive lower bound on the column sum for any even $ \lambda$. For any disjoint decomposition of $ \lambda$ as $\lambda_1 \sqcup \lambda_2 $ we obtain a lower bound for the column sum at $ \lambda$ in terms of the product of the column sums for $ \lambda_1$ and$\lambda_2$. This can be expressed as a super-additivity property for the logarithms of column sums of normalized characters.

hep-th↗

arXiv2024

Permutation invariant matrix quantum thermodynamics and negative specific heat capacities in large N systems

We study the thermodynamic properties of the simplest gauged permutation invariant matrix quantum mechanical system of oscillators, for general matrix size $N$. In the canonical ensemble, the model has a transition at a temperature $T$ given by $x = e^{ -1/ T } \sim x_c=e^{-1/T_c}=\frac{\log N}{N}$, characterised by a sharp peak in the specific heat capacity (SHC), which separates a high temperature from a low temperature region. The peak grows and the low-temperature region shrinks to zero with increasing $N$. In the micro-canonical ensemble, for finite $N$, there is a low energy phase with negative SHC and a high energy phase with positive SHC. The low-energy phase is dominated by a super-exponential growth of degeneracies as a function of energy which is directly related to the rapid growth in the number of directed graphs, with any number of vertices, as a function of the number of edges. The two ensembles have matching behaviour above the transition temperature. We further provide evidence that these thermodynamic properties hold in systems with $U(N)$ symmetry such as the zero charge sector of the 2-matrix model and in certain tensor models. We discuss the implications of these observations for the negative specific heat capacities in gravity using the AdS/CFT correspondence.

hep-th↗

arXiv2024

Gauged permutation invariant matrix quantum mechanics: Path Integrals

We give a path integral construction of the quantum mechanical partition function for gauged finite groups. Our construction gives the quantization of a system of $d$, $N\times N$ matrices invariant under the adjoint action of the symmetric group $S_N$. The approach is general to any discrete group. For a system of harmonic oscillators, i.e. for the non-interacting case, the partition function is given by the Molien-Weyl formula times the zero-point energy contribution. We further generalise the result to a system of non-square and complex matrices transforming under arbitrary representations of the gauge group.

hep-th↗

arXiv2023

Gauged permutation invariant matrix quantum mechanics: Partition functions

The Hilbert spaces of matrix quantum mechanical systems with $N \times N$ matrix degrees of freedom $ X $ have been analysed recently in terms of $S_N$ symmetric group elements $U$ acting as $X \rightarrow U X U^T $. Solvable models have been constructed uncovering partition algebras as hidden symmetries of these systems. The solvable models include an 11-dimensional space of matrix harmonic oscillators, the simplest of which is the standard matrix harmonic oscillator with $U(N)$ symmetry. The permutation symmetry is realised as gauge symmetry in a path integral formulation in a companion paper. With the simplest matrix oscillator Hamiltonian subject to gauge permutation symmetry, we use the known result for the micro-canonical partition function to derive the canonical partition function. It is expressed as a sum over partitions of $N$ of products of factors which depend on elementary number-theoretic properties of the partitions, notably the least common multiples and greatest common divisors of pairs of parts appearing in the partition. This formula is recovered using the Molien-Weyl formula, which we review for convenience. The Molien-Weyl formula is then used to generalise the formula for the canonical partition function to the 11-parameter permutation invariant matrix harmonic oscillator.

hep-th↗

arXiv2023

Permutation invariant tensor models and partition algebras

Matrix models with continuous symmetry are powerful tools for studying quantum gravity and holography. Tensor models have also found applications in holographic quantum gravity. Matrix models with discrete permutation symmetry have been shown to satisfy large $N$ factorisation properties relevant to holography, while also having applications to the statistical analysis of ensembles of real-world matrices. Here we develop 3-index tensor models in dimension $D$ with a discrete symmetry of permutations in the symmetric group $S_D$. We construct the most general permutation invariant Gaussian tensor model using the representation theory of symmetric groups and associated partition algebras. We define a representation basis for the 3-index tensors, where the two-point function is diagonalised. Inverting the change of basis gives an explicit formula for the two-point function in the tensor basis for general $D$.

hep-th↗

arXiv2023

Permutation invariant matrix statistics and computational language tasks

The Linguistic Matrix Theory programme introduced by Kartsaklis, Ramgoolam and Sadrzadeh is an approach to the statistics of matrices that are generated in type-driven distributional semantics, based on permutation invariant polynomial functions which are regarded as the key observables encoding the significant statistics. In this paper we generalize the previous results on the approximate Gaussianity of matrix distributions arising from compositional distributional semantics. We also introduce a geometry of observable vectors for words, defined by exploiting the graph-theoretic basis for the permutation invariants and the statistical characteristics of the ensemble of matrices associated with the words. We describe successful applications of this unified framework to a number of tasks in computational linguistics, associated with the distinctions between synonyms, antonyms, hypernyms and hyponyms.

cs.CL↗

arXiv2023

Quantum mechanics of bipartite ribbon graphs: Integrality, Lattices and Kronecker coefficients

We define solvable quantum mechanical systems on a Hilbert space spanned by bipartite ribbon graphs with a fixed number of edges. The Hilbert space is also an associative algebra, where the product is derived from permutation group products. The existence and structure of this Hilbert space algebra has a number of consequences. The algebra product, which can be expressed in terms of integer ribbon graph reconnection coefficients, is used to define solvable Hamiltonians with eigenvalues expressed in terms of normalized characters of symmetric group elements and degeneracies given in terms of Kronecker coefficients, which are tensor product multiplicities of symmetric group representations. The square of the Kronecker coefficient for a triple of Young diagrams is shown to be equal to the dimension of a sub-lattice in the lattice of ribbon graphs. This leads to an answer to the long-standing question of a combinatoric interpretation of the Kronecker coefficients. As an avenue to explore quantum supremacy and its implications for computational complexity theory, we outline experiments to detect non-vanishing Kronecker coefficients for hypothetical quantum realizations/simulations of these quantum systems. The correspondence between ribbon graphs and Belyi maps leads to an interpretation of these quantum mechanical systems in terms of quantum membrane world-volumes interpolating between string geometries.

hep-th↗