arXiv subjects

Joseph Ben Geloun

Publications and source records attributed to Joseph Ben Geloun.

At least 19 recordsLinked to original sources

arXiv2025

Multiple-Order Tensor Field Theory: Enumeration of unitary invariant observables

In Tensor Field Theory (TFT), observables are defined through tensor field contractions that produce unitary invariants for complex-valued tensor fields. Traditionally, these observables are constructed using tensor fields of a fixed order $d$. Here, we propose an extended theoretical framework for TFT that incorporates tensor fields of varying orders $d'$, satisfying $d' \leq d$. We then establish a comprehensive group-theoretic formalism that enables the systematic enumeration of these complex TFT observables. This approach encompasses existing counting methods and therefore recovers known results in specific limiting cases. Additionally, we provide computational tools to facilitate the enumeration of these invariants, unveiling novel integer sequences that have not been documented elsewhere.

math-ph↗

arXiv2024

Elementary methods for splitting representations of Rook monoids: a gentle introduction to groupoids

We show that the algebra of the coloured rook monoid $R_n^{(r)}$, {\em i.e.} the monoid of $n \times n$ matrices with at most one non-zero entry (an $r$-th root of unity) in each column and row, is the algebra of a finite groupoid, thus is endowed with a $C^*$-algebra structure. This new perspective uncovers the representation theory of these monoid algebras by making manifest their decomposition in irreducible modules.

cs.DM↗

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 $λ$ 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 $ λ$. For any disjoint decomposition of $ λ$ as $λ_1 \sqcup λ_2 $ we obtain a lower bound for the column sum at $ λ$ in terms of the product of the column sums for $ λ_1$ and$λ_2$. This can be expressed as a super-additivity property for the logarithms of column sums of normalized characters.

hep-th↗

arXiv2024

Counting $U(N)^{\otimes r}\otimes O(N)^{\otimes q}$ invariants and tensor model observables

$U(N)^{\otimes r} \otimes O(N)^{\otimes q}$ invariants are constructed by contractions of complex tensors of order $r+q$, also denoted $(r,q)$. These tensors transform under $r$ fundamental representations of the unitary group $U(N)$ and $q$ fundamental representations of the orthogonal group $O(N)$. Therefore, $U(N)^{\otimes r} \otimes O(N)^{\otimes q}$ invariants are tensor model observables endowed with a tensor field of order $(r,q)$. We enumerate these observables using group theoretic formulae, for arbitrary tensor fields of order $(r,q)$. Inspecting lower-order cases reveals that, at order $(1,1)$, the number of invariants corresponds to a number of 2- or 4-ary necklaces that exhibit pattern avoidance, offering insights into enumerative combinatorics. For a general order $(r,q)$, the counting can be interpreted as the partition function of a topological quantum field theory (TQFT) with the symmetric group serving as gauge group. We identify the 2-complex pertaining to the enumeration of the invariants, which in turn defines the TQFT, and establish a correspondence with countings associated with covers of diverse topologies. For $r>1$, the number of invariants matches the number of ($q$-dependent) weighted equivalence classes of branched covers of the 2-sphere with $r$ branched points. At $r=1$, the counting maps to the enumeration of branched covers of the 2-sphere with $q+3$ branched points. The formalism unveils a wide array of novel integer sequences that have not been previously documented. We also provide various codes for running computational experiments.

hep-th↗

arXiv2023

One-loop beta-functions of quartic enhanced tensor field theories

Enhanced tensor field theories (eTFT) have dominant graphs that differ from the melonic diagrams of conventional tensor field theories. They therefore describe pertinent candidates to escape the so-called branched polymer phase, the universal geometry found for tensor models. For generic order $d$ of the tensor field, we compute the perturbative $β$-functions at one-loop of two just-renormalizable quartic eTFT coined by $+$ or $\times$, depending on their vertex weights. The models $+$ has two quartic coupling constants $(λ, λ_{+})$, and two 2-point couplings(mass, $Z_a$). Meanwhile, the model $\times$ has two quartic coupling constants $(λ, λ_{\times})$ and three 2-point couplings (mass, $Z_a$, $Z_{2a}$). At all orders, both models have a constant wave function renormalization: $Z=1$ and therefore no anomalous dimension. Despite such peculiar behavior, both models acquire nontrivial radiative corrections for the coupling constants. The RG flow of the model $+$ exhibits a particular asymptotic safety: $λ_{+}$ is marginal without corrections thus is a fixed point of arbitrary constant value. All remaining couplings determine relevant directions and get suppressed in the UV. Concerning the model $\times$, $λ_{\times}$ is marginal and again a fixed point (arbitrary constant value), $λ$, $μ$ and $Z_a$ are all relevant couplings and flow to 0. Meanwhile $Z_{2a}$ is a marginal coupling and becomes a linear function of the time scale. This model can neither be called asymptotically safe or free.

hep-th↗

arXiv2023

Parallel Computation of Multi-Slice Clustering of Third-Order Tensors

Machine Learning approaches like clustering methods deal with massive datasets that present an increasing challenge. We devise parallel algorithms to compute the Multi-Slice Clustering (MSC) for 3rd-order tensors. The MSC method is based on spectral analysis of the tensor slices and works independently on each tensor mode. Such features fit well in the parallel paradigm via a distributed memory system. We show that our parallel scheme outperforms sequential computing and allows for the scalability of the MSC method.

cs.DC↗

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↗

arXiv2023

QFT with Tensorial and Local Degrees of Freedom: Phase Structure from Functional Renormalization

Field theories with combinatorial non-local interactions such as tensor invariants are interesting candidates for describing a phase transition from discrete quantum-gravitational to continuum geometry. In the so-called cyclic-melonic potential approximation of a tensorial field theory on the $r$-dimensional torus it was recently shown using functional renormalization group techniques that no such phase transition to a condensate phase with a tentative continuum geometric interpretation is possible. Here, keeping the same approximation, we show how to overcome this limitation amending the theory by local degrees freedom on $\mathbb{R}^d$. We find that the effective $r-1$ dimensions of the torus part dynamically vanish along the renormalization group flow while the $d$ local dimensions persist up to small momentum scales. Consequently, for $d>2$ one can find a phase structure allowing also for phase transitions.

hep-th↗

arXiv2023

DBSCAN of Multi-Slice Clustering for Third-Order Tensors

Several methods for triclustering three-dimensional data require the cluster size or the number of clusters in each dimension to be specified. To address this issue, the Multi-Slice Clustering (MSC) for 3-order tensor finds signal slices that lie in a low dimensional subspace for a rank-one tensor dataset in order to find a cluster based on the threshold similarity. We propose an extension algorithm called MSC-DBSCAN to extract the different clusters of slices that lie in the different subspaces from the data if the dataset is a sum of r rank-one tensor (r > 1). Our algorithm uses the same input as the MSC algorithm and can find the same solution for rank-one tensor data as MSC.

cs.LG↗

arXiv2023

The quantum detection of projectors in finite-dimensional algebras and holography

We define the computational task of detecting projectors in finite dimensional associative algebras with a combinatorial basis, labelled by representation theory data, using combinatorial central elements in the algebra. In the first example, the projectors belong to the centre of a symmetric group algebra and are labelled by Young diagrams with a fixed number of boxes $n$. We describe a quantum algorithm for the task based on quantum phase estimation (QPE) and obtain estimates of the complexity as a function of $n$. We compare to a classical algorithm related to the projector identification problem by the AdS/CFT correspondence. This gives a concrete proof of concept for classical/quantum comparisons of the complexity of a detection task, based in holographic correspondences. A second example involves projectors labelled by triples of Young diagrams, all having $n$ boxes, with non-vanishing Kronecker coefficient. The task takes as input the projector, and consists of identifying the triple of Young diagrams. In both of the above cases the standard QPE complexities are polynomial in $n$. A third example of quantum projector detection involves projectors labelled by a triple of Young diagrams, with $m,n$ and $m+n$ boxes respectively, such that the associated Littlewood-Richardson coefficient is non-zero. The projector detection task is to identify the triple of Young diagrams associated with the projector which is given as input. This is motivated by a two-matrix model, related via the AdS/CFT correspondence, to systems of strings attached to giant gravitons. The QPE complexity in this case is polynomial in $m$ and $n$.

quant-ph↗

arXiv2023

Multiway clustering of 3-order tensor via affinity matrix

We propose a new method of multiway clustering for 3-order tensors via affinity matrix (MCAM). Based on a notion of similarity between the tensor slices and the spread of information of each slice, our model builds an affinity/similarity matrix on which we apply advanced clustering methods. The combination of all clusters of the three modes delivers the desired multiway clustering. Finally, MCAM achieves competitive results compared with other known algorithms on synthetics and real datasets.

cs.LG↗

arXiv2023

Universality for polynomial invariants on ribbon graphs with half-ribbons

In this paper, we analyze the Bollobás and Riordan polynomial $\mathcal{R}$ for ribbon graphs with half-ribbons introduced in [Combinatorics, Probability and Computing 31, 507-549, 2022]. We prove the universality property of a multivariate version of $\mathcal{R}$ whereas $\mathcal{R}$ itself turns out to be universal for a subclass of ribbon graphs with half-ribbons. We also show that $\mathcal{R}$ can be defined on some equivalence classes of ribbon graphs involving half-ribbons moves and that the new polynomial is universal on these classes.

math.GT↗

arXiv2022

Extending the Tutte and Bollobás-Riordan Polynomials to Rank 3 Weakly-Colored Stranded Graphs

The Bollobás-Riordan polynomial [Math. Ann. 323, 81 (2002)] is a universal polynomial invariant for ribbon graphs. We find an extension of this polynomial for a particular family of combinatorial objects, called rank 3 weakly-colored stranded graphs. Stranded graphs arise in the study of tensor models for quantum gravity in physics, and generalize graphs and ribbon graphs. We present a seven-variable polynomial invariant of these graphs, which obeys a contraction/deletion recursion relation similar to that of the Tutte and Bollobás-Riordan polynomials. However, it is defined on a much broader class of objects, and furthermore captures properties that are not encoded by the Tutte or Bollobás-Riordan polynomials.

math.GT↗

arXiv2022

Kronecker coefficients from algebras of bi-partite ribbon graphs

Bi-partite ribbon graphs arise in organising the large $N$ expansion of correlators in random matrix models and in the enumeration of observables in random tensor models. There is an algebra $\mathcal{K}(n)$, with basis given by bi-partite ribbon graphs with $n$ edges, which is useful in the applications to matrix and tensor models. The algebra $\mathcal{K}(n)$ is closely related to symmetric group algebras and has a matrix-block decomposition related to Clebsch-Gordan multiplicities, also known as Kronecker coefficients, for symmetric group representations. Quantum mechanical models which use $\mathcal{K}(n)$ as Hilbert spaces can be used to give combinatorial algorithms for computing the Kronecker coefficients.

hep-th↗

arXiv2022

On the counting of $O(N)$ tensor invariants

$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular graphs, using permutation group techniques. We also list their generating functions and give (software) algorithms computing their number at an arbitrary rank and an arbitrary number of vertices. As an interesting property, we reveal that the algebraic structure which organizes these invariants differs from that of the unitary invariants. The underlying topological field theory formulation of the rank $d$ counting shows that it corresponds to counting of coverings of the $d-1$ cylinders sharing the same boundary circle and with $d$ defects. At fixed rank and fixed number of vertices, an associative semi-simple algebra with dimension the number of invariants naturally emerges from the formulation. Using the representation theory of the symmetric group, we enlighten a few crucial facts: the enumeration of $O(N)$ invariants gives a sum of constrained Kronecker coefficients; there is a representation theoretic orthogonal base of the algebra that reflects its dimension; normal ordered 2-pt correlators of the Gaussian models evaluate using permutation group language, and further, via representation theory, these functions provide other representation theoretic orthogonal bases of the algebra.

math-ph↗

arXiv2021

Multi-Slice Clustering for 3-order Tensor Data

Several methods of triclustering of three dimensional data require the specification of the cluster size in each dimension. This introduces a certain degree of arbitrariness. To address this issue, we propose a new method, namely the multi-slice clustering (MSC) for a 3-order tensor data set. We analyse, in each dimension or tensor mode, the spectral decomposition of each tensor slice, i.e. a matrix. Thus, we define a similarity measure between matrix slices up to a threshold (precision) parameter, and from that, identify a cluster. The intersection of all partial clusters provides the desired triclustering. The effectiveness of our algorithm is shown on both synthetic and real-world data sets.

cs.LG↗

arXiv2021

All-orders asymptotics of tensor model observables from symmetries of restricted partitions

The counting of the dimension of the space of $U(N) \times U(N) \times U(N)$ polynomial invariants of a complex $3$-index tensor as a function of degree $n$ is known in terms of a sum of squares of Kronecker coefficients. For $n \le N$, the formula can be expressed in terms of a sum of symmetry factors of partitions of $n$ denoted $Z_3(n)$. We derive the large $n$ all-orders asymptotic formula for $ Z_3(n)$ making contact with high order results previously obtained numerically. The derivation relies on the dominance in the sum, of partitions with many parts of length $1$. The dominance of other small parts in restricted partition sums leads to related asymptotic results. The result for the $3$-index tensor observables gives the large $n$ asymptotic expansion for the counting of bipartite ribbon graphs with $n$ edges, and for the dimension of the associated Kronecker permutation centralizer algebra. We explain how the different terms in the asymptotics are associated with probability distributions over ribbon graphs. The large $n$ dominance of small parts also leads to conjectured formulae for the asymptotics of invariants for general $d$-index tensors. The coefficients of $ 1/n$ in these expansions involve Stirling numbers of the second kind along with restricted partition sums.

hep-th↗

arXiv2020

On the counting tensor model observables as $U(N)$ and $O(N)$ classical invariants

Real or complex tensor model observables, the backbone of the tensor theory space, are classical (unitary, orthogonal, symplectic) Lie group invariants. These observables represent as colored graphs, and that representation gives an handle to study their combinatorial, topological and algebraic properties. We give here an overview of the symmetric group-theoretic formulation of the enumeration of unitary and orthogonal invariant observables which turns out to bear a rich structure. From their counting formulae, one finds a correspondence with topological field theory on 2-cellular complexes that brings other interpretations of the same countings. Furthermore, tensor model observables span an algebra that turns out to be semi-simple. Dealing with complex tensors, we discuss the representation theoretic base of the algebra making explicit its Wedderburn-Artin decomposition. The real case is more subtle as a base of its Wedderburn-Artin decomposition is yet unknown.

hep-th↗