SearcharxivSearch

arXiv · 2403.19361

Polyadic sigma matrices

Abstract

We generalize $\sigma$-matrices to higher arities using the polyadization procedure proposed by the author. We build the nonderived $n$-ary version of $SU\left( 2\right) $ using cyclic shift block matrices. We define a new function, the polyadic trace, which has an additivity property analogous to the ordinary trace for block diagonal matrices and which can be used to build the corresponding invariants. The elementary $\Sigma$-matrices introduced here play a role similar to ordinary matrix units, and their sums are full $\Sigma$-matrices which can be treated as a polyadic analog of $\sigma$-matrices. The presentation of $n$-ary $SU\left( 2\right) $ in terms of full $\Sigma$-matrices is done using the Hadamard product. We then generalize the Pauli group in two ways: for the binary case we introduce the extended phase shifted $\sigma$-matrices with multipliers in cyclic groups of order $4q$ ($q>4$), and for the polyadic case we construct the correspondent finite $n$-ary semigroup of phase-shifted elementary $\Sigma$-matrices of order $4q\left( n-1\right) +1$, and the finite $n$-ary group of phase-shifted full $\Sigma$-matrices of order $4q$. Finally, we introduce the finite $n$-ary group of heterogeneous full $\mathit{\Sigma}^{het}$-matrices of order $\left( 4q\left( n-1\right) \right) ^{4}$. Some examples of the lowest arities are presented.

Explore related subjects

Keep this discovery

BibTeXRIS

Steven Duplij. 2024-03-28. Polyadic sigma matrices. https://doi.org/10.1063/5.0211252

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR