Abstract
A generalization of the semisimplicity concept for polyadic algebraic structures is proposed. If semisimple structures can be presented as block diagonal matrices (resulting in the Wedderburn decomposition), general forms of polyadic structures are given by block-shift matrices. We combine these forms to get a general shape of semisimple nonderived polyadic structures (“double” decomposition of two kinds). We then introduce the polyadization concept (a “polyadic constructor”), according to which one can construct a nonderived polyadic algebraic structure of any arity from a given binary structure. The polyadization of supersymmetric structures is also discussed. The “deformation” by shifts of operations on the direct power of binary structures is defined and used to obtain a nonderived polyadic multiplication. Illustrative concrete examples for the new constructions are given.
MSC:
16T25; 17A42; 20B30; 20F36; 20M17; 20N15
1. Introduction
I am no poet, but if you think for yourselves, as I proceed, the facts will form a poem in your minds. Michael Faraday.“The Life and Letters of Faraday” (1870) by Bence Jones.
The concept of simple and semisimple rings, modules, and algebras (see, e.g., [1,2,3,4]) plays a crucial role in the investigation of Lie algebras and representation theory [5,6,7], as well as in category theory [8,9,10].
Here we first propose a generalization of this concept for polyadic algebraic structures [11], which can also be important, e.g., in the operad theory [12,13] and nonassociative structures [14,15]. If semisimple structures can be presented in block-diagonal matrix form (resulting to the Wedderburn decomposition [16,17,18]), corresponding general forms for polyadic rings can be decomposed to block-shift matrices [19]. We combine these forms and introduce a general shape of semisimple polyadic structures, which are nonderived in the sense that they cannot be obtained as successive compositions of binary operations, which can be treated as polyadic (“double”) decomposition.
Second, going in the opposite direction, we define the polyadization concept (“polyadic constructor”) according to which one can construct a nonderived polyadic algebraic structure of any arity from a given binary structure. Then, we briefly describe supersymmetric structure polyadization.
Third, we propose operations “deformed” by shifts to obtain a nonderived n-ary multiplication on the direct power of binary algebraic structures.
For these new constructions, some illustrative concrete examples are given.
2. Preliminaries
We use notation from [11,20]. In brief, a (one-set) polyadic algebraic structure is a set A closed with respect to polyadic operations (or n-ary multiplication) (n-ary magma). We denote polyads [21] by bold letters , . A polyadic zero is defined by , , , where z can be on any place. A (positive) polyadic power is . An element of a polyadic algebraic structure a is called -nilpotent (or simply nilpotent for ), if there exist such that . A polyadic (orn-ary) identity (or neutral element) is defined by , where a can be on any place in the left-hand side. A one-set polyadic algebraic structure is totally associative if , with respect to placement of the internal multiplication on any of the n places, and are polyads of the necessary sizes [22,23]. A polyadic semigroup is a one-set and one-operation structure in which is totally associative. A polyadic structure is commutative, if , or , , for all .
A polyadic structure is solvable, if for all polyads , and an element x, one can (uniquely) resolve the equation (with respect to h) for , where x can be on any place, and are polyads of the needed lengths. A solvable polyadic structure is called a polyadic quasigroup [24]. An associative polyadic quasigroup is called a n-ary (or polyadic) group [25]. In an n-ary group the only solution of
is called a querelement of a and denoted by [26], where can be on any place. Any idempotent a coincides with its querelement . The relation (1) can be considered as a definition of the unary queroperation [27]. For further details and definitions, see [11].
3. Polyadic Semisimplicity
In general, simple algebraic structures are building blocks (direct summands) for the semisimple ones satisfying special conditions (see, e.g., [1,3]).
3.1. Simple Polyadic Structures
According to the Wedderburn–Artin theorem (see, e.g., [17,18,28]), a ring which is simple (having no two-sided ideals, except zero and the ring itself) and Artinian (having minimal right ideals) is isomorphic to a full matrix ring
over a division ring . As a corollary,
where is a d-finite-dimensional vector space (left module) over . In the same way, a finite-dimensional simple associative algebra over an algebraically closed field is
In the polyadic case, the structure of a simple Artinian -ring (with binary addition and n-ary multiplication ) was obtained in [19], where the Wedderburn–Artin theorem for -rings was proved. Thus, instead of one vector space , one should consider a direct sum of vector spaces (over the same division ring ), that is,
where is a -dimensional polyadic vector space [23], . Then, instead of (3) we have the cyclic direct sum of homomorphisms
This means that after choosing a suitable basis in terms of matrices (when the ring multiplication coincides with the product of n matrices) we have
Theorem 1.
Remark 1.
The set of the fixed size blocks does not form a binary ring, because .
Assertion 1.
The block-shift matrices of the form (8) are closed with respect to n-ary multiplication and binary addition, and we call them n-ary matrices.
Taking distributivity into account, we arrive at the polyadic ring structure (7).
Corollary 1.
Assertion 2.
A finite-dimensional simple associative n-ary algebra over an algebraically closed field [29] is isomorphic to the block-shift n-ary matrix (8) over
3.2. Semisimple Polyadic Structures
The Wedderburn–Artin theorem for semisimple Artinian rings states that is a finite direct product of k simple rings, each of which has the form (2). Using (3) for each component, we decompose the d-finite-dimensional vector space (left module) into a direct sum of length k
where . Then, instead of (3) we have the following isomorphism. (We enumerate simple components by an upper index in round brackets and block-shift components by lower index without brackets, and the arity is an upper index in square brackets .)
With a suitable basis, the Wedderburn–Artin theorem follows.
Theorem 2.
A semisimple Artinian (binary) ring is isomorphic to the matrix ring
where and are binary addition and binary product of matrices, and are block-diagonal matrices of the form (which follows from (12))
where k square blocks are full matrix rings over division rings
The same matrix structure has a finite-dimensional semisimple associative algebra over an algebraically closed field (see (4)). For further details, see, e.g., [17,18,28].
General properties of semisimple Artinian -rings were considered in [19] (for ternary rings, see [30,31]). Here we propose a new manifest matrix structure for them.
In matrix language, this means that each block from the polyadic ring (8) should have the semisimple decomposition (14), i.e., be a block-diagonal square matrix of the same size , where and the total matrix size becomes . Moreover, all blocks should have diagonal blocks of the same size, and therefore for all and , where k is the number of semisimple components. In this way, the cyclic direct sum of homomorphisms for the semisimple polyadic rings becomes (we use different division rings for each semisimple component as in (15))
After choosing a suitable basis, we obtained a polyadic analog of the Wedderburn–Artin theorem for semisimple Artinian -rings , which can be called as the double decomposition (of the first kind or shift-diagonal).
Theorem 3.
The semisimple polyadic Artinian ring (of the first kind) is isomorphic to the matrix ring
where are the binary addition and ordinary product of n matrices, (n is the arity of s and k is number of simple components of ’s) are the block-shift n-ary matrices with block-diagonal square blocks (which follows from (17))
where
and the k square blocks are full matrix rings over the division rings
Remark 2.
This allows us to introduce another possible double decomposition in the opposite sequence to (19) and (20); we call it the second kind or reverse, or diagonal-shift. Indeed, for a suitable basis, we first provide the standard block-diagonal decomposition (14), and then each block obeys the block-shift decomposition (8). Here we do not write the “reverse” analog of (17) and arrive directly at
Theorem 4.
The semisimple polyadic Artinian ring (of the second kind) is isomorphic to the matrix ring
where are the binary addition and ordinary product of n matrices, (n is arity of ’s and k is number of simple components of ’s) are the block-diagonal n-ary matrices with block-shift nonsquare blocks
where
and the blocks are nonsquare matrices over the division rings
Definition 1.
Proposition 1.
The polyadic rings of the first and second kind are not isomorphic.
Proof.
Thus, the two double decompositions introduced above can lead to a new classification for polyadic analogs of semisimple rings.
Example 1.
Let us consider the double decomposition of two kinds for ternary () rings with two semisimple components () and blocks as full matrix rings over . Indeed, we have for the ternary nonderived rings and of the first and second kind, respectively, the following block structures:
where . In terms of component blocks, the ternary multiplications in the rings and are
kind I:
kind II:
Note that the sum of the block structures (30) obeys nontrivial properties.
Remark 3.
Consider a binary sum of the block matrices of the first and second kind: (30)
The set of matrices (35) forms the nonderived -ring over
where are the binary addition and ordinary product of 3 matrices (35).
Notice that the -matrices (35) are the block-matrix versions of the circle matrices , which were studied in [32] in connection with 8-vertex solutions to the constant Yang–Baxter equation [33] and the corresponding braiding quantum gates [34,35].
Supersymmetric Double Decomposition
Let us generalize the above double decomposition (of the first kind) to superrings and superalgebras. For that we first assume that the constituent vector spaces (entering in (17)) are super vector spaces (-graded vector spaces) obeying the standard decomposition into even and odd parts:
where and are dimensions of the even and odd spaces, respectively; .
The parity of a homogeneous element of the vector space is defined by (resp. ), if (resp. ), and . For details, see [36,37]. In the graded case, the k square blocks in (23) are full supermatrix rings of the size , while the square s (20) are block-diagonal supermatrices, and the block-shift n-ary supermatrices have a nonstandard form (19).
4. Polyadization Concept
Here we propose a general procedure for how to construct new polyadic algebraic structures from binary (or lower arity) ones, using the “inverse” (informally) to the block-shift matrix decomposition (8). It can be considered as a polyadic analog of the inverse problem of the determination of an algebraic structure from the knowledge of its Wedderburn decomposition [38].
4.1. Polyadization of Binary Algebraic Structures
Let a binary algebraic structure be represented by matrices over a ring (a linear representation), where is the set of parameters corresponding to an element x of . As the binary addition in transfers to the matrix addition without restrictions (as opposed to the polyadic case, see below), we will consider only the multiplicative part of the resulting polyadic matrix ring. In this way, we propose a special block-shift matrix method to obtain n-ary semigroups (n-ary groups) from the binary ones, but the former are not derived from the latter [11,25]. In general, this can lead to new algebraic structures that were not known before.
Definition 2.
A (block-matrix) polyadization of a binary semigroup (or group) represented by square matrices is an n-ary semigroup (or an n-ary group) represented by the block-shift matrices (over a ring ) of the form (8) as follows:
where , and the n-ary multiplication is given by the product of n matrices (38).
In terms of the block-matrices , the multiplication
has the cyclic product form (see [39])
Remark 4.
The number of parameters describing an element increases to , and the corresponding algebraic structure becomes n-ary, and so (38) can be treated as a new algebraic structure, which we denote by the same letter with the arities in double square brackets .
We now analyze some of the most general properties of the polyadization map , which are independent of the concrete form of the block-matrices and over which algebraic structure (ring, field, etc.) they are defined. We then present some concrete examples.
Definition 3.
A unique polyadization is a polyadization where all sets of parameters coincide
Proposition 2.
The unique polyadization is an n-ary-binary homomorphism.
Proof.
Assertion 3.
If matrices contain the identity matrix , then the n-ary identity in , has the form
In this case, the unique polyadization maps the identity matrix to the n-ary identity .
Assertion 4.
If the matrices are invertible , then each has a querelement
satisfying
where can be on any places and
Proof.
Let us suppose that on the set of matrices over a binary ring , one can consider some analog of a multiplicative character , being a (binary) homomorphism, such that
For instance, in case , the determinant can be considered to have a (binary) multiplicative character. Similarly, we can introduce
Definition 4.
A polyadized multiplicative character is proportional to a product of the binary multiplicative characters of the blocks
The normalization factor in (51) is needed to be consistent with the case when is commutative, and the multiplicative characters are determinants. It can also be consistent in other cases.
Proposition 3.
If the ring is commutative, then the polyadized multiplicative character ∅ is an n-ary-binary homomorphism.
Proposition 4.
If the ring is commutative and unital with the unit , then the algebraic structure contains polyadic (n-ary) idempotents satisfying
4.2. Concrete Examples of the Polyadization Procedure
4.2.1. Polyadization of
Consider the polyadization procedure for the general linear group . We have for the 4-parameter block matrices , . Thus, the 12-parameter 4-ary group is represented by the following -matrices:
obeying the 4-ary multiplication:
In terms of the block matrices , the multiplication (54) becomes (see (39)–(42))
which can be further expressed in the -matrix entries (its manifest form is too cumbersome to give here).
For to be a 4-ary group, each -matrix should have the unique querelement determined by the equation (see (48)):
which has the solution
where (see (49))
In the manifest form, the querelements of are (59), where
where are the (nonvanishing) determinants of .
Definition 5.
We call a polyadic (4-ary) general linear group.
If we take the binary multiplicative characters to be determinants , then the polyadized multiplicative character in becomes
which is a 4-ary-binary homomorphism, because (see (55)–(57))
The 4-ary identity of is unique and has the form (see (46))
where is the identity of . The 4-ary identity satisfies the 4-ary idempotence relation
In general, the 4-ary group contains an infinite number of 4-ary idempotents defined by the system of equations
which gives
or manifestly
The infinite set of idempotents in is determined by complex parameters, because one block matrix (with 4 complex parameters) can always be excluded using the Equation (69).
4.2.2. Polyadization of
Here we provide a polyadization for the simplest subgroup of , the special orthogonal group . In the matrix form, is represented by the one-parameter rotation matrix
satisfying the commutative multiplication
and the (binary) identity is . Therefore, the inverse element for is .
The 4-ary polyadization of is given by the 3-parameter 4-ary group of Q-matrices , where (cf. (53))
and the 4-ary multiplication is
which is noncommutative, as opposed to the binary product of B-matrices (75).
Definition 6.
We call a polyadic (4-ary) special orthogonal group, and is called a polyadic (4-ary) rotation matrix.
Informally, the matrix represents the polyadic (4-ary) rotation. There is an infinite number of polyadic (4-ary) identities (neutral elements) which are defined by
and the solution is
It follows from (81) that are 4-ary idempotents (see (67) and Remark 5).
The determinants of and are 1, and therefore the corresponding multiplicative characters and polyadized multiplicative characters (51) are also equal to one.
Compared with the successive products of four B-matrices (74)
we observe that 4-ary multiplication (78) gives a shifted sum of four angles.
More exactly, for the triple we introduce the circle (left) shift operator by
with the property . Then, the 4-ary multiplication (78) becomes
The querelement has the form
The multiplication (85) can be (informally) expressed in terms of a new operation, the 4-ary “cyclic shift addition” defined on by (see (78))
where is (informally)
and . This can also be treated as some “deformation” of the repeated binary additions by shifts. It is seen that the 4-ary operation (87) is not derived and cannot be obtained by consequent binary operations on the triples as (83).
In terms of the 4-ary cyclic shift addition, the 4-ary multiplication (85) becomes
4.3. "Deformation" of Binary Operations by Shifts
The concrete example from the previous subsection shows the strong connection (89) between the polyadization procedure and the shifted operations (88). Here we generalize it to an n-ary case for any semigroup.
Let be a binary semigroup, where A is its underlying set and is the binary operation (which can be noncommutative). The simplest way to construct an n-ary operation is the consequent repetition of the binary operation (see (83))
where the n-ary multiplication (90) is called derived [26,40].
To construct a nonderived operation, we now consider the (external) mth direct power of the semigroup by introducing m-tuples
The mth direct power becomes a binary semigroup by endowing m-tuples with the componentwise binary operation as
The derived n-ary operation for m-tuples (on the mth direct power) is then defined componentwise by analogy with (90)
Now using shifts, instead of (93) we construct a nonderived n-ary operation on the direct power.
Definition 7.
For instance, in this notation, if and , then , , (as in the previous subsection).
To obtain a nonderived n-ary operation, by analogy with (87), we deform by shifts the derived n-ary operation (93).
Definition 8.
Note that till now there exist no relations between n and m.
Proposition 5.
The shift deformed operation is totally associative, if
Proof.
We compute
which are satisfied in all lines, if (96). □
Corollary 2.
Proposition 6.
If the binary semigroup is commutative, then becomes a nonderived n-ary group , such that each element has a unique querelement (an analog of inverse) by
where is an unary queroperation.
Proof.
We have the definition of the querelement
where can be on any place. Thus, (95) gives the equation
which can be resolved for the commutative and cancellative semigroup only, and the solution is (99). If is on the ith place in (100), then it has the coefficient , and we multiply both sides by to get without any shift operator coefficient using (96), which gives the same solution (99). □
It is known that the existence of an identity (as a neutral element) is not necessary for polyadic groups, and only a querelement is important [26,27]. Nevertheless, we have
Proposition 7.
If the commutative and cancellative semigroup has zero , then the n-ary group has a set of polyadic identities (idempotents) satisfying
where is the zero -tuple.
Proof.
The definition of polyadic identity in terms of the deformed n-ary product in the direct power is
For and , we obtain an infinite set of identities satisfying
To see that they are 4-ary idempotents, insert into (106).
Thus, starting from a binary semigroup , using our polyadization procedure, we have obtained a nonderived n-ary group on th direct power with the shift deformed multiplication. This construction draws on the post-like associative quiver from [11,22], and allows us to construct a nonderived n-ary group from any semigroup in the unified way presented here.
4.4. Polyadization of Binary Supergroups
Here we consider a more exotic possibility, when the -matrices are defined over the Grassmann algebra, and therefore can represent supergroups (see (37) and below). In this case, s can be supermatrices of two kinds, even and odd, which have different properties [36,37]. The general polyadization procedure remains the same as for the ordinary matrices considered before (see Definition 2), and therefore we confine ourselves to examples only.
Indeed, to obtain an n-ary matrix (semi)group represented now by the -supermatrices (38) of the nonstandard form, we should take initial -supermatrices which present a simple ( in (20)) binary (semi)supergroup, which now have different parameters , , where and are even and odd dimensions of the -supermatrix. The closure of the -supermatrix multiplication is governed by the closure of -supermatrix multiplication (40)–(42) in the initial binary (semi)supergroup.
Polyadization of
Let be a Grassmann algebra over , where and are its even and odd parts (it can be also any commutative superalgebra). We provide (in brief) the polyadization procedure of the general linear supergroup for . The 4-parameter block (invertible) supermatrices become , where the parameters are . Thus, the 8-parameter ternary supergroup is represented by the following -supermatrices:
which satisfy the ternary (nonderived) multiplication
In terms of the B-supermatrix parameters, the supergroup is defined by the following component ternary multiplication
The unique querelement in can be found from the equation (see (48)):
where the solution is
with (see (49))
and .
Definition 9.
We call a polyadic (ternary) general linear supergroup obtained by the polyadization procedure from the binary linear supergroup .
The ternary identity of has the form (see (46))
where is the identity of , and it is ternary idempotent:
The ternary supergroup contains the infinite number of ternary idempotents defined by the system of equations
which gives
Therefore, the idempotents are determined by Grassmann parameters. One of the ways to realize this is to exclude from (120) the -supermatrix. In this case, the idempotents in the supergroup become
where is an invertible supermatrix of the standard form (see Remark 5).
In the same way one, can polyadize any supergroup that can be presented by supermatrices.
5. Conclusions
In this paper we have given answers to the following important questions: how can one obtain nonderived polyadic structures from binary ones, and what would be a matrix form of their semisimple versions? First, we introduced a general matrix form for polyadic structures in terms of block-shift matrices. If the blocks correspond to a binary structure (a ring, semigroup, group, or supergroup), this can be treated as a polyadization procedure for them. Second, the semisimple blocks which further have a block-diagonal form give rise to semisimple nonderived polyadic structures. For a deeper and expanded understanding of the new constructions introduced, we have given clarifying examples. The polyadic structures presented can be used, e.g., for the further development of differential geometry and operad theory, as well as in other directions which use higher arity and nontrivial properties of the constituent universal objects.
Funding
This research received no external funding.
Acknowledgments
The author is grateful to Vladimir Akulov, Mike Hewitt, Dimitrij Leites, Vladimir Tkach, Raimund Vogl, and Alexander Voronov for useful discussions and valuable help.
Conflicts of Interest
The author declares no conflict of interest.
References
- Erdmann, K.; Holm, T. Algebras and Representation Theory; Springer: Cham, Switzerland, 2018. [Google Scholar] [CrossRef]
- Hungerford, T.W. Algebra; Springer: New York, NY, USA, 1974; p. 502. [Google Scholar]
- Lambek, J. Lectures on Rings and Modules; Blaisdell: Providence, RI, USA, 1966; p. 184. [Google Scholar]
- Rotman, J.J. Advanced Modern Algebra, 2nd ed.; AMS: Providence, RI, USA, 2010. [Google Scholar] [CrossRef]
- Curtis, C.W.; Reiner, I. Representation Theory of Finite Groups and Associative Algebras; AMS: Providence, RI, USA, 1962. [Google Scholar]
- Fulton, W.; Harris, J. Representation Theory: A First Course; Springer: New York, NY, USA, 2004; p. 551. [Google Scholar]
- Knapp, A.W. Representation Theory of Semisimple Groups; Princeton University Press: Princeton, NJ, USA, 1986. [Google Scholar] [CrossRef]
- Harada, M. On semi-simple abelian categories. Osaka J. Math. 1970, 7, 89–95. [Google Scholar]
- Knop, F. A construction of semisimple tensor categories. C. R. Math. 2006, 343, 15–18. [Google Scholar] [CrossRef]
- Simson, D. Pure semisimple categories and rings of finite representation type. J. Algebra 1977, 48, 290–296. [Google Scholar] [CrossRef]
- Duplij, S. Polyadic Algebraic Structures; IOP Publishing: Bristol, UK, 2022; p. 461. [Google Scholar] [CrossRef]
- Markl, M.; Shnider, S.; Stasheff, J. Operads in Algebra, Topology and Physics; AMS: Providence, RI, USA, 2002. [Google Scholar]
- Loday, J.L.; Vallette, B. Algebraic Operads; Springer: Heidelberg, Germany, 2012; p. 634. [Google Scholar]
- Zhevlakov, K.A.; Slin’ko, A.M.; Shestakov, I.P.; Shirshov, A.I.; Smith, H.F. (Eds.) Rings That are Nearly Associative; Pure and Applied Mathematics 104; Academic Press: New York, NY, USA, 1982. [Google Scholar]
- Sabinin, L.V.; Sbitneva, L.; Shestakov, I. (Eds.) Non-Associative Algebra and Its Applications; Number 246 in Lecture Notes in Pure and Applied Mathematics; CRC Press: Boca Raton, FL, USA, 2006. [Google Scholar]
- Wedderburn, J.H.M. On hypercomplex numbers. Proc. Lond. Math. Soc. 1908, 6, 77–118. [Google Scholar] [CrossRef]
- Herstein, I.N. Noncommutative Rings; Mathematical Association of America: Washington, DC, USA, 1996; p. 214. [Google Scholar]
- Lam, T.Y. A First Course in Noncommutative Rings; Springer: New York, NY, USA, 1991. [Google Scholar] [CrossRef]
- Nikitin, A.N. Semisimple Artinian (2,n)-rings. Mosc. Univ. Math. Bull. 1984, 39, 1–6. [Google Scholar]
- Duplij, S. Polyadic analogs of direct product. Universe 2022, 8, 230. [Google Scholar] [CrossRef]
- Post, E.L. Polyadic groups. Trans. Am. Math. Soc. 1940, 48, 208–350. [Google Scholar] [CrossRef]
- Duplij, S. Polyadic Algebraic Structures And Their Representations. In Proceedings of the Exotic Algebraic and Geometric Structures in Theoretical Physics; Duplij, S., Ed.; Nova Publishers: New York, NY, USA, 2018; pp. 251–308. [Google Scholar]
- Duplij, S. Arity shape of polyadic algebraic structures. J. Math. Phys. Anal. Geom. 2019, 15, 3–56. [Google Scholar] [CrossRef]
- Belousov, V.D. n-Ary Quasigroups; Shtintsa: Kishinev, Moldova, 1972; p. 225. [Google Scholar]
- Gal’mak, A.M. n-Ary Groups, Part 1; Gomel University: Gomel, Belarus, 2003; p. 195. [Google Scholar]
- Dörnte, W. Unterschungen über einen verallgemeinerten Gruppenbegriff. Math. Z. 1929, 29, 1–19. [Google Scholar] [CrossRef]
- Gleichgewicht, B.; Głazek, K. Remarks on n-groups as abstract algebras. Colloq. Math. 1967, 17, 209–219. [Google Scholar] [CrossRef][Green Version]
- Hazewinkel, M.; Gubareni, N.M. Algebras, Rings and Modules: Non-Commutative Algebras and Rings; CRC Press: Boca Raton, FL, USA, 2016; p. 388. [Google Scholar]
- Carlsson, R. N-ary algebras. Nagoya Math. J. 1980, 78, 45–56. [Google Scholar] [CrossRef]
- Lister, W.G. Ternary rings. Trans. Am. Math. Soc. 1971, 154, 37–55. [Google Scholar] [CrossRef]
- Profera, L. Anelli ternari di Lister semisemplici. Note Mat. 1982, 11, 1–56. [Google Scholar]
- Duplij, S.; Vogl, R. Polyadic Braid Operators and Higher Braiding Gates. Universe 2021, 7, 301. [Google Scholar] [CrossRef]
- Lambe, L.A.; Radford, D.E. Introduction to the Quantum Yang-Baxter Equation and Quantum Groups: An Algebraic Approach; Kluwer: Dordrecht, The Netherlands, 1997; p. 292. [Google Scholar]
- Kauffman, L.H.; Lomonaco, S.J. Braiding Operators are Universal Quantum Gates. New J. Phys. 2004, 6, 134–139. [Google Scholar] [CrossRef]
- Melnikov, D.; Mironov, A.; Mironov, S.; Morozov, A.; Morozov, A. Towards topological quantum computer. Nucl. Phys. 2018, B926, 491–508. [Google Scholar] [CrossRef]
- Berezin, F.A. Introduction to Superanalysis; Reidel: Dordrecht, The Netherlands, 1987; p. 421. [Google Scholar]
- Leites, D. Supermanifold Theory; Karelia Branch of the USSR Academy of Sciences: Petrozavodsk, Russia, 1983. [Google Scholar]
- Dietzel, C.; Mittal, G. Summands of finite group algebras. Czech. Math. J. 2021, 71, 1011–1014. [Google Scholar] [CrossRef]
- Duplij, S. Higher braid groups and regular semigroups from polyadic-binary correspondence. Mathematics 2021, 9, 972. [Google Scholar] [CrossRef]
- Zupnik, D. Polyadic semigroups. Publ. Math. Debr. 1967, 14, 273–279. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).