SearcharxivSearch

arXiv subjects

Guruprasad

Publications and source records attributed to Guruprasad.

4 recordsLinked to original sources

Regular diagonal subfactors

We show that a diagonal subfactor arising from a finite family of automorphisms of a $II_1$-factor $Q$ is regular precisely when the classes of the defining automorphisms occur with same cardinality and form a subgroup of $\mathrm{Out}(Q)$, a subgroup that happens to be isomorphic to the generalized Weyl group of the subfactor. Moreover, it turns out that the cleanest picture of regularity in diagonal subfactors is graph-theoretic, namely, a diagonal subfactor is regular precisely when its principal graph is a complete, regular, balanced bipartite multigraph, with the generalized Weyl group fixing its size and the common multiplicity of the defining automorphisms determining its regular edge multiplicity. Prior to the characterization of regularity, revisiting Bisch and Popa's observations on the standard invariant and depth of diagonal subfactors, we give an exact criterion for a diagonal subfactor to have any prescribed depth, in terms of a stabilizing sequence of subsets of $\mathrm{Out}(Q)$ consisting of non-reduced alternating words in the classes of the defining automorphisms, which proves useful in the characterization of regularity.

math.OA

Intersection of conjugate Hadamard subfactors arising from Fourier matrices

Given two distinct complex Hadamard matrices belonging to the same equivalence class generated by the tensor products of Fourier matrices, we show that if the corresponding Hadamard subfactors are conjugate, then their intersection is a factor with finite Jones index. We compute the index of the intersection explicitly and determine its relative commutant. Furthermore, we precisely characterize when these intersections give rise to vertex model subfactors, thereby extending our earlier results in low dimensions. As an application, we derive an explicit formula for the Connes-St{\o}rmer relative entropy associated with these intersections. These results reveal how the internal algebraic structure of complex Hadamard matrices governs the relative position and entropic behaviour of the subfactors.

math.OA

A noncommutative construction of families of biunitary matrices and application to subfactors

We introduce a construction that, given a pair (u,v) of complex Hadamard matrices of the same order, generates infinitely many biunitary matrices of varying (and distinct) orders. As a key application, this framework yields nested sequences of vertex model subfactors that are not a tower of downward basic construction. Notably, the construction is noncommutative: interchanging the matrices (i.e., considering (v,u) instead of (u,v)) can lead to non-isomorphic subfactors. Focusing on the Hadamard equivalence class of the Fourier matrix, we provide a full characterization of the resulting vertex model subfactors, along with explicit computations of their relative commutants. Along the way, we conduct a detailed study of certain naturally arising inner and outer automorphisms that play a key role in the structure of these subfactors.

math.OA

Conjugate pairs of Hadamard subfactors and vertex models

We show that any two Hadamard subfactors arising from a pair of distinct complex Hadamard matrices of order 3 are either equal or conjugate by a unitary in the relative commutant of their intersection. Moreover, when the Hadamard subfactors are not equal, we prove the factoriality of their intersection, and it turns out to be a vertex model subfactor. We compute the first relative commutant and characterize this subfactor by identifying it with a particular type of Krishnan-Sunder subfactor. A few key invariants, including the Pimsner-Popa probabilistic number, the angle, and the Connes-St{\o}rmer relative entropy for the pair of Hadamard subfactors are computed to understand their relative position.

math.OA