Skip to Content
AxiomsAxioms
  • Article
  • Open Access

6 March 2026

Multiary Gradings

1
Yantai Research Institute, Harbin Engineering University, Yantai 265615, China
2
Center for Information Technology, Universität Münster, Röntgenstrasse 7-13, D-48149 Münster, Germany

Abstract

This article develops a comprehensive theory of multiary graded polyadic algebras, extending the classical concept of group-graded algebras to higher-arity structures. We introduce the notion of grading by multiary groups and investigate various compatibility conditions between the arity of algebra operations and grading group operations. Key results include quantization rules connecting arities, classification of graded homomorphisms, the First Isomorphism Theorem for graded polyadic algebras and concrete examples including ternary superalgebras and polynomial algebras over n-ary matrices. The theory reveals fundamentally new phenomena not present in the binary case, such as the existence of higher power gradings and nontrivial constraints on arity compatibility.
MSC:
13A02; 13A30; 16W50; 17A70; 20H20; 20N10; 20N15; 81Q60

1. Introduction

The theory of graded algebras and rings [1,2,3] represents a fundamental chapter in modern algebra [4,5], with profound applications across mathematics [6,7,8,9] and theoretical physics [10,11,12,13,14]. Classically, a grading on an algebra A over a field k by a group G consists of a decomposition A = g G A ( g ) into homogeneous components such that the multiplication respects the group structure A ( g ) · A ( h ) A ( g + h ) . This elegant framework encompasses numerous important structures including superalgebras (graded by Z 2 ) [15,16,17], polynomial algebras (graded by degree) [18,19], group algebras and rings [20,21,22].
Recent developments in polyadic (multiplace) algebra [23] have opened new avenues for generalization, where binary operations are replaced by n-ary ones. Building upon our previous work on the polyadic generalization of group rings R G [24], we now extend the related concept of the grading to the polyadic realm. Polyadic structures exhibit rich and often surprising behavior: polyadic groups may lack identity elements, polyadic fields may have no zero or unit, and associativity takes more intricate forms. These features necessitate a fundamental revision of many standard algebraic constructions.
In this work, we introduce and systematically develop the theory of multiary graded polyadic algebras. Our approach follows the “arity freedom principle” [23], allowing initial arities to be arbitrary, with structural constraints emerging from compatibility conditions. The main contributions are as follows:
(1)
A general definition of multiary G -graded polyadic k -algebras, where both the algebra operations and grading group operations may have arbitrary arities (Section 3).
(2)
Quantization rules connecting the arities of algebra multiplication (n), grading group multiplication ( n ), and algebra addition (m) with the order of the grading group (Theorems 1 and 3).
(3)
A classification of graded homomorphisms between multiary graded algebras, and the First Isomorphism Theorem for graded polyadic algebras is proved (Section 4).
(4)
Concrete examples including
  • Derived ternary superalgebras with binary Z 2 -grading (Section 5);
  • Strictly nonderived ternary superalgebras with ternary grading groups (Example 5);
  • Polynomial algebras over n-ary matrices graded by polyadic integers Z [ m , n ] (Section 6);
  • Higher power multiary gradings with n n (Section 7).
(5)
Investigation of support properties, strong grading conditions, and the relationship between graded components and polyadic powers.
Our results reveal that the transition from binary to polyadic grading introduces qualitatively new phenomena. For instance, the compatibility condition between algebra n-ary multiplication and grading group n -ary multiplication leads to “quantization” rules like n = n for strongly graded algebras, while higher power gradings satisfy n ( n 1 ) = n ( n 1 ) , where denotes polyadic power. These constraints have no analogs in classical graded algebra theory.
The article is structured as follows: Section 2 reviews the essential polyadic notations and preliminaries. Section 3 presents the general theory of multiary graded polyadic algebras. Section 4 develops the theory of graded homomorphisms. Section 5, Section 6 and Section 7 provide detailed examples and applications, demonstrating the richness and versatility of the theory.

2. Preliminaries

A grading on an algebra A (over a field k , say) by a group G (called the grading group) is a way to decompose A into “layers” indexed by elements of G . Formally, the algebra A is G -graded, if
(1)
A is a direct sum of k -vector spaces
A = g G A g ,
where each A g is called the homogeneous component of degree g , and they do not intersect: A g A h = , if g h . So, every element of A can be uniquely written as a = g G a g , with a g A g , notation g = deg a , and only finitely many nonzero elements a g 0 , such that, in each component, it has finite support.
(2)
The multiplication in A respects the grading, that is, for product of algebra components
A g · A h A g + h , g , h G ,
where the grading group G is typically abelian ( Z , Z n , Z × n ), written additively, with the identity 0 . Thus, A 0 · A g A g , and A g · A 0 A g . The grading is strong if, instead of (2), the equality A g · A h = A g + h holds (used for crossed product algebras).
The grading is “natural”, if algebra homomorphisms preserve grading, that is, for any algebras map Φ : A B , the homogeneity is preserved Φ A g B g , for any g G . If the algebra is associative, we can extend the associativity across grades to preserve degrees. If the algebra element is invertible, then deg a 1 = g (in additive notation).
The most common examples of the graded algebra are polynomial algebra k x , exterior algebra V and superalgebra and group algebra k G (any k G is a G -graded algebra, but not vice-versa).
To generalize the concept of graded algebra to the polyadic case, we need some polyadic notation [23], to be self-consistent here.
Notation 1. 
An algebraic structure M will be denoted by
M = M o r d e r a r i t y p a r a m e t e r ,
where a r i t y represents the number of operation places under consideration, that is, arity(ies), o r d e r denotes the number of the carrier element or power of underlying set(s), p a r a m e t e r gives additional variable(s), which characterize the structure M , and they are used when necessary.
Let A be a set and μ n : A × n A be a polyadic multiplication. An n-ary magma is A closed under μ n and denoted by M n = A μ n . The admissible word length in M n is “quantized”, which means
w = n 1 + 1 ,
where is a polyadic power, that is, the “number of multiplications”. For any element a A , the polyadic power is denoted by
x = μ n a , a , , a n 1 + 1 .
An n-ary operation is strictly nonderived, if it cannot be composed from a binary operation without fixing elements or additional conditions. A polyadic identity e A is defined as (if it exists)
μ n e , e , , e n 1 , a = a ,
and the polyadic zero z A is
μ n a , a , , a n 1 , z = z .
A polyadic semigroup in a one-set one-operation structure S n = A μ n , a s s o c , which is totally associative
μ n 2 a , b , c = μ n a , μ n b , c = i n v a r i a n t ,
with respect to the position of the middle multiplication, where a , b , c are polyads (sequences of elements) of the needed sizes. Note, that in higher arity case the associativity can be partial [25], which can lead to more complicated structural consequences (see, e.g., [26,27]).
The querelement a ¯ for a S is defined by
μ n a , a , , a n 1 , a ¯ = a ,
which can be treated as an unary queroperation μ ¯ 1 a = a ¯ = a ¯ . If every element of an n-ary semigroup S has the unique querelement, it is called a polyadic (n-ary) group G n = A μ n , ( ) ¯ , a s s o c . A polyadic or m , n -ring is a one-set two operation algebraic structure R m , n = A ν m , μ n , a s s o c , d i s t r , such that m-ary addition ν m and n-ary multiplication μ n satisfy distributivity [28].
Example 1 
(Ternary polynomial graded algebra). A natural example of a ternary Z -graded algebra is a polynomial ring of three variables A 2 , 3 = k x , y , z over a field k = R , x , y , z R , and the addition and multiplication by scalar are binary for the algebra A 2 , 3 . The grading of elements is defined by deg 1 = 0 Z , deg x = 1 Z , and the monomial degree is
deg x p y q z r = p + q + r ,
where p , q , r Z , and therefore, the grading group is binary G = Z . The direct sum decomposition (1) becomes
A 2 , 3 = p Z A p ,
where A 3 p is the homogeneous component of degree p Z , and obviously, A p A q = for p q Z . The ternary product in algebra A 3 is defined as the ordinary multiplication · of polynomials in three variables f x , y , z k x , y , z as
μ 3 f , g , h = f · g · h A 2 , 3 , f , g , h A 2 , 3 ,
such that μ 3 is trilinear and respects grading, because from (10) and (12), cf. the binary case (2), it follows that
μ 3 A p , A q , A r = A p + q + r .
Because there is equality in (13), the grading is strong. Thus, the ternary graded algebra A 2 , 3 is commutative and ternary associative, it is non-truncated because there are no relations, and the polynomial ring is free. It is infinite-dimensional as a vector space, but each homogeneous component A p of the direct sum decomposition (11) is finite-dimensional, and dim A p = p + 2 2 .

3. General Grading of Polyadic Algebra by Multiary Group

Let us generalize the grading concept to the polyadic case by consideration of higher arity in both the algebra and grading group. According to the “arity freedom principle” [23], the initial arities can be arbitrary; then, the structural constraints appear from the general dependences leading to “quantization rules”. Polyadic structures can display unusual properties and behaviors. For example, some polyadic groups have no identity element at all, while others may have multiple identities. Likewise, there are polyadic fields that lack a zero, a unit, or both [23]. These features can require a substantial rethinking of many standard mathematical statements.
A polyadic algebra over a polyadic field is the 2-set 5-higher arity operation algebraic structure satisfying compatibility axioms [23,29]. However, in our consideration here, we will use the binary field k and consider only the corresponding k -algebra m-ary addition ν a m : A × m A and n-ary multiplication μ a n : A × n A , and therefore, for n-ary algebra we denote
A m , n = A ν a m , μ a n ,
where A is its underlying set, and zero or unit are not necessary. The grading group now becomes the n -ary group
G n = G μ g n , ( ) ¯ ,
where G is the group underlying set, the n -ary multiplication is μ g n : G × n G , and ( ) ¯ is the unary operation of taking querelement (polyadic inverse (9)), while no identity element (6) is necessary but can exist for some polyadic groups; see, e.g., [23]. Similarly to the binary case, we assume that the grading n -ary group G n is commutative.
Notation 2. 
We call the generic algebraic structure with multiplace operations (after [30]) “polyadic” (ring, field, algebra, group), while for the grading group, just for distinctiveness, convenience and clarity, we use its Latin synonym “multiary” [31].
Remark 1. 
To be far from the well-known binary case, we assume both multiplications μ a n and μ g n are nonderived (or not strictly derived), i.e., they are not consequent compositions of binary operations only (the weaker b-derived multiplication is a different story [32]).
The expansion into the direct sum for the polyadic algebra A m , n (14) does not differ from that of the binary algebras (1). The crucial peculiarities come from the polyadic analog of the compatibility condition (2), which gives several kinds of the polyadic graded algebras.
Definition 1. 
A multiary G -graded polyadic k -algebra is the direct sum decomposition of k -vector spaces
A m , n = g i G n A g i ,
such that the n-ary multiplication in the algebra respects the n -ary multiplication in the grading group
μ a n A g 1 , A g 2 , , A g n A μ g n g 1 , g 2 , , g n ,
where A g i is the ith component of the decomposition (16).
A polyadic algebra is strongly graded, if, as in (17), the the equality is
μ a n A g 1 , A g 2 , , A g n = A μ g n g 1 , g 2 , , g n .
Definition 2. 
The support of a polyadic G -graded algebra supp A m , n is the set of all grading group elements g i G n such that the corresponding component A g i as k -vector space contributes to the direct sum decomposition (16).
The number of “non-zero” (contributing) summands in the decomposition (16) is exactly the cardinality of the support; that is, supp A m , n . Because supp A m , n G n , the number of summands in (16) is supp A m , n G .
Assertion 1. 
For strongly G -graded polyadic algebra (18),
supp A m , n = G .
Proof. 
If A m , n is strongly graded and “non-zero”, then every A g i is “non-zero”, and therefore, the number of summands coincides with the graded group order G . □
Proposition 1. 
The strong polyadic algebra arity of multiplication and the arity of multiary grading group coincide:
n = n .
Proof. 
This follows from the construction (18) by equating the number of components as the multiplier in the algebra product μ a n and number of the elements in the grading group product μ g n . □
Remark 2. 
If the grading group has the identity e G n , at first glance, we can obtain the unequally possibility n > n by adding e to the remaining n n places in (18) to get μ g n g 1 , g 2 , , g n , e , , e n n , but this destroys the coincidence of the total polyadic associativity in both sides of (18).
Remark 3. 
The strong consistency condition (18) can be interpreted such that the components A g i for n = n satisfy the polyadic homomorphism relation [23].
In the next section, it will be shown that there exist such multiary gradings, for which the arities n and n are different, which can lead to unusual structural consequences, which are impossible in the ordinary binary case.
In the manifest form, the direct sum decomposition (16) means that each element of A m , n can be written as a finite sum (using the algebra m-ary addition) of homogeneous elements
a = ν a m a g 1 , a g 2 , , a g m , a A m , n , a g i A g i , g i G n .
However, this expression contains only one algebra addition operation ν a m , which corresponds to the one summation in the binary case as a = a g 1 + a g 2 , while the binary decomposition (1) contains supp A m , n 1 summations. Denote by m the polyadic power (5) of m-ary addition in the polyadic algebra A m , n . Then, instead of (21), we have the decomposition of each element as
a = ν a m m a g 1 , a g 2 , , a g m m 1 + 1 , a A m , n , a g i A g i , g i G n .
For a strongly graded algebra A m , n , there are no zeroes among homogeneous components a g i . In this case, the support is not just a subgroup; it is the entire group supp A m , n = G n .
Theorem 1. 
In the polyadic strongly G -graded algebras, the order of the finite grading group G and the arity of algebra addition m are connected by
G = m m 1 + 1 .
Proof. 
This follows from the admissible length m m 1 + 1 of a word for m-ary operation repeated m times (4) and from (19), (22). □
In the case of the binary algebra addition m = 2 , the number of summands in the decomposition becomes m + 1 , where m is the number of sum signs (5). In most cases, supp A m , n is a subgroup of G n . If A m , n is unital with the unity e , then e A e , where e is the identity of the group G n (if it exists), and then e supp A m , n .

4. Polyadic Graded Homomorphisms

Consider another multiary H -graded polyadic algebra,
B m , n = h i H n B h i ,
which has the same arity shape as A m , n (14).
Definition 3. 
A polyadic graded homomorphism is a pair Φ Ψ of maps Φ : A m , n B m , n and Ψ : G n H n , which respect m-ary additions
Φ ν a m a 1 , a 2 , , a m = ν b m Φ a 1 , Φ a 2 , , Φ a m ,
and n-ary multiplications
Φ μ a n a 1 , a 2 , , a n = μ b n Φ a 1 , Φ a 2 , , Φ a n , a j A m , n , Φ a j B m , n ,
in algebras and n -ary multiplications in the grading groups
Ψ μ g n g 1 , g 2 , , g n = μ g n Ψ g 1 , Ψ g 2 , , Ψ g n , g j G n , Ψ g j H n ,
being algebra and grading group homomorphisms, respectively. In addition, they “preserve” grading, such that
Φ A g B Ψ g , g G n , Ψ g H n ,
for every graded component in (16).
In the case Ψ = id , the grading groups coincide G n = H n , and homogeneous elements in A m , n are really preserved as
Φ A g B g , g G n ,
which means that they are mapped to the same corresponding homogeneous elements in B m , n .
Definition 4. 
A graded homomorphism of polyadic algebras, which is defined by the pair Φ Ψ of maps Φ : A m , n B m , n , Ψ : G n H n , becomes a graded isomorphism (for binary case see, e.g., [33]), if both Φ and Ψ are bijective, which preserves the grading by definition of bijectivity, and therefore, the inverse Φ 1 : B m , n A m , n   Ψ 1 : H n G n , is also a graded homomorphism Φ 1 Ψ 1 . If both inverse maps exist, the polyadic graded algebras A m , n and B m , n are called graded isomorphic. If A m , n = B m , n , and G n = H n , the graded isomorphism becomes a graded automorphism.
Example 2 
(Graded homomorphism). Let A 2 , 3 be the ternary graded algebra from Example 1. Consider the map Φ : A 2 , 3 A 2 , 3 defined by
Φ f x , y , z = f x + 1 , y + 1 , z + 1 , f A 2 , 3 .
The map Φ preserves (see (26)) ternary multiplication Φ μ 3 f , g , h = μ 3 Φ f , Φ g , Φ h , f , g , h A 2 , 3 , since
Φ μ 3 f , g , h x , y , z = μ 3 f , g , h x + 1 , y + 1 , z + 1 = f x + 1 , y + 1 , z + 1 · g x + 1 , y + 1 , z + 1 · h x + 1 , y + 1 , z + 1 ,
which is equal to
μ 3 Φ f , Φ g , Φ h x , y , z = f x + 1 , y + 1 , z + 1 · g x + 1 , y + 1 , z + 1 · h x + 1 , y + 1 , z + 1 .
The map Φ (30) preserves (see (25)) the binary addition, which follows from the ordinary additivity of polynomials Φ f + g = Φ f + Φ g . Therefore, Φ is a ternary homomorphism of the ternary algebra A 2 , 3 .
To show that Φ preserves grading, for each graded component A p in the decomposition (11), we should have Φ A p A p (28). Indeed, acting by Φ on any monomial (10) does not increase its degree, because no terms of higher degree appear, and so, obviously, deg Φ x p y q z r = deg x + 1 p y + 1 q z + 1 r , and deg Φ f = deg f , which means that Φ maps each homogeneous component to itself.
Thus, the map Φ (30) is a graded homomorphism (being of zero grading) of the ternary algebra A 2 , 3 , it is nontrivial since it changes polynomials; moreover, it is a graded automorphism, because Φ is an isomorphism of the algebra A 2 , 3 to itself, and Φ Φ 1 = Φ 1 Φ = id , where Φ 1 f x , y , z = f x 1 , y 1 , z 1 , f A 2 , 3 .
The main difference of polyadic structures (rings, fields, algebras, groups) from their binary counterparts is not the necessity of the existence of identities, units (6) or zeroes (7), such that there exist, e.g., unitless and zeroless fields or algebras, as well as polyadic groups without identity or many identities. Instead, the invertibility is governed by the existence of querelements (9) for multiplications and additions (for review and examples, see [23]). Therefore, the properties of graded homomorphisms are changed correspondingly: mappings of unit to unit and zero to zero are demanded, if they exist. However, querelements should be mapped to querelements. Thus, we have
Proposition 2. 
If and only if both algebras in Φ : A m , n B m , n have units (6) e A and e B (are unital), and both polyadic groups in Ψ : G n H n have identities e G and e H , respectively, then
Φ e A = e B ,
Ψ e G = e H .
Proof. 
This follows directly from application of the mapping Φ , Ψ to the definitions (6) and using the homomorphism property. □
Obviously,
Assertion 2. 
Sets of elements in A m , n and G n that map under Φ and Ψ to the unit and identity of B m , n and H n form subalgebra of A m , n and subgroup of G n , respectively.
Proposition 3. 
If and only if both algebras in Φ : A m , n B m , n have zeroes (6) z A and z B , respectively, then
Φ z A = z B .
Proof. 
This follows from (7) and (26) directly. □
Denote a ¯ , b ¯ and g ¯ , h ¯ as the querelements of polyadic algebra elements a A m , n , b B m , n and the grading n -ary group elements g G n , h H n , respectively (see (9)). Then,
Proposition 4. 
The querelements are mapped to the corresponding querelements, as
Φ a = b Φ a ¯ = b ¯ , a A m , n , b B m , n
Ψ g = g Ψ g ¯ = h ¯ , g G n , h H n .
Proof. 
This follows directly from (9) and (26). □
Corollary 1. 
If A s u b m , n is a graded subalgebra of A m , n , then Φ A s u b m , n is a graded subalgebra of Φ A m , n . Oppositely, if B s u b m , n is a graded subalgebra of B m , n , then Φ 1 B s u b m , n is a graded subalgebra of Φ 1 B m , n .
Definition 5. 
If Φ : A m , n B m , n is the graded homomorphism, then its image is defined by
im Φ = Φ a a A m , n B m , n .
Because A m , n and B m , n are graded having the direct sum decompositions (16) and (24), the subspaces im Φ B g i = Φ A g i form a grading (decomposition) of the image, as follows:
im Φ = g i G n Φ A g i ,
which is a polyadic graded subalgebra, since it follows from (17) and the homomorphism multiplicative property of Φ , that
μ b n Φ A g 1 , Φ A g 2 , , Φ A g n Φ A μ g n g 1 , g 2 , , g n .
Remark 4. 
In contrast to the binary case, where a zero element always exists, and the kernel is therefore always definable as the preimage of zero, in the polyadic setting, the standard kernel can be defined only if the polyadic algebra B m , n possesses a zero.
Definition 6 
(Standard kernel). If and only if the algebra B m , n in Φ : A m , n B m , n has zero (6) z B , then the standard kernel of Φ can be defined by
ker Φ = a A m , n Φ a = z B .
Because Φ is a polyadic algebra homomorphism (26), its standard kernel (41) is an ideal of A m , n (not only a graded subalgebra, as im Φ ). Moreover, ker Φ inherits a grading from A m , n becoming a graded ideal, which means that there is decomposition on homogeneous components
ker Φ = g i G n ker Φ A g i ,
such that, if an element belongs to the standard kernel, than each of its homogeneous components also belongs to it. Thus, ker Φ is always generated, as an ideal, by the homogeneous components of any element of the standard kernel (41).
A more general definition of a kernel is needed to avoid difficulty with the absence of some elements; see Remark 4. In universal algebra [5,34] the kernel is defined as a special equivalence relation (congruence) on the domain and not as a set of elements mapping to the identity (for groups) or to zero for B m , n (41).
Definition 7 
(Congruence kernel). The congruence kernel of the homomorphism Φ, denoted ker θ Φ , is the equivalence relation
θ ker θ Φ = a 1 , a 2 A m , n × A m , n Φ a 1 = Φ a 2 ,
which is compatible with all operations in A m , n .
The set definition (41) is a special case of the congruence definition (43), where the algebraic structure gives the possibility (which is not always the case, see Remark 4) to describe the congruence by a single distinguished congruence class: the preimage of identity or zero. The congruence ker θ Φ respects grading, such that it only relates elements of the same degree (cf. (42)):
ker θ Φ = g i G n ker θ Φ A g i × A g i .
The congruence definition (43) allows us to form the quotient polyadic algebra A m , n ker θ Φ , whose elements are the equivalence classes of the congruence θ denoted by a θ for a A m , n :
A m , n ker θ Φ = A ¯ m , n = a θ ν ¯ m , μ ¯ n , a A m , n .
The operations on classes ν ¯ m , μ ¯ n can be naturally defined using representatives, as follows:
ν ¯ a m a 1 θ , a 2 θ , , a m θ ν a m a 1 , a 2 , , a m θ ,
μ ¯ n a 1 θ , a 2 θ , , a m θ μ a n a 1 , a 2 , , a n θ , a i A m , n ,
and they are well-defined, because the resulting r.h.s. do not depend on the choice of the representatives (which directly follows from the homorphism property and (43)). The quotient polyadic algebra A m , n ker θ Φ respects multiary grading, such that the decomposition (16) with the compatibility (17) provides
A ¯ m , n = g i G n A ¯ g i ,
and therefore, A ¯ m , n is a multiary graded polyadic algebra.
Theorem 2 
(First Isomorphism Theorem). Let A m , n and B m , n be multiary graded polyadic algebras, and let Φ : A m , n B m , n be a multiary graded homomorphism; then, the quotient algebra (45) is isomorphic to the graded image im Φ being a subalgebra of B m , n ,
A m , n ker θ Φ im Φ .
Proof. 
Define the map Φ ¯ on the congruence classes (45) A m , n ker θ Φ Φ A m , n by
Φ ¯ a θ = Φ a , a A m , n .
It is well-defined, because, if a θ = b θ , a , b A m , n , then a , b ker θ Φ , and so Φ a = Φ b ; thus, Φ ¯ a θ = Φ ¯ b θ .
The map Φ ¯ respects G -grading: if a θ A ¯ g , g G n , then a A g , and so Φ a B g Φ A m , n = Φ A g , the graded component of the image im Φ .
It is an algebra map that preserves the polyadic operations; that is, we derive
Φ ¯ ν ¯ a m a 1 θ , a 2 θ , , a m θ = Φ ¯ ν a m a 1 , a 2 , , a m θ = Φ ν a m a 1 , a 2 , , a m
= ν a m Φ a 1 , Φ a 2 , , Φ a m = ν a m Φ ¯ a 1 θ , Φ ¯ a 2 θ , , Φ ¯ a m θ ,
Φ ¯ μ ¯ n a 1 θ , a 2 θ , , a m θ = Φ ¯ μ a n a 1 , a 2 , , a n θ = Φ μ a n a 1 , a 2 , , a n
= μ a n Φ a 1 , Φ a 2 , , Φ a m = μ a n Φ ¯ a 1 θ , Φ ¯ a 2 θ , , Φ ¯ a n θ , a i A m , n ,
because Φ is a homomorphism of A m , n .
The map Φ ¯ is injective, such that, if Φ ¯ a θ = Φ ¯ b θ , a , b A m , n , then Φ a = Φ b , and so, a , b ker θ Φ ; hence, a θ = b θ .
It is surjective, because for any b Φ A , there exists a A with b = Φ a , and so, Φ ¯ a θ = b .
Therefore, the map Φ ¯ (50) is a surjective and injective (i.e., bijective) G -graded homomorphism, hence an isomorphism (49). □
Thus, the First Isomorphism Theorem for G -graded polyadic algebras states that the structure of the image of a homomorphism is exactly the same as the structure of the domain “collapsed” by the equivalence relation induced by the map. This formulation ensures that all structural properties (the polyadic algebra operations and the multiary group grading) are rigorously preserved through the isomorphism.
Let us denote the set of N elements by G N = 0 , 1 , , N N 0 . The simplest binary group on G 2 = 0 , 1 is the cyclic group of order 2 (or integers modulo 2) Z 2 = G 2 = G 2 μ g 2 with the binary operation μ g 2 x , y = x + y mod 2 , x , y G 2 .
Example 3. 
Consider the polynomial ring Z t graded by degree, reduced mod 6 and mod 3 . The corresponding Z -graded ternary algebra A 3 , 3 with zero and the zeroless Z -graded ternary algebra B 3 , 3 are
A 3 , 3 = Z t ν a 3 , μ a 3 , μ Z 0 = k 0 A k , A k = a k · t k , a k Z 6 Z = 0 , 1 , 2 , 3 , 4 , 5 ,
B 3 , 3 = Z t ν b 3 , μ b 3 = k 0 B k , B k = b k · t k , b k Z 3 Z = 0 , 1 , 2 ,
where A 3 , 3 is a ternary algebra with zero named in its signature as the null-ary operation μ Z 0 = z A = 0 Z 6 Z , and B 3 , 3 is a ternary algebra without zero (in signature), without binary substruction. The coefficients a k and b k are in (different) congruence classes of Z 6 Z and Z 3 Z , respectively. The graded components A k ( B k ) have deg ( A k ) = deg ( B k ) = k . The operations in A 3 , 3 and B 3 , 3 are
ν a 3 x , y , z = x + y + z mod 6 Z 6 Z , μ a 3 x , y , z = x y z mod 6 Z 6 Z ,
μ a , Z 0 = 0 Z 6 Z ,
ν b 3 x , y , z = x + y + z mod 3 Z 3 Z , μ b 3 x , y , z = x y z mod 3 Z 3 Z .
By construction, the ternary operations (57) and (58) satisfy ternary distributivity and are totally associative and commutative, as both algebras are, and they respect grading by the group G = Z 0 ; that is,
ν a 3 A k 1 A k 2 A k 3 A k 1 + k 2 + k 3 , μ a 3 A k 1 A k 2 A k 3 A k 1 + k 2 + k 3 ,
ν b 3 B k 1 B k 2 B k 3 B k 1 + k 2 + k 3 , μ b 3 B k 1 B k 2 B k 3 B k 1 + k 2 + k 3 .
We define the homomorphism Φ : A 3 , 3 B 3 , 3 by
Φ x = x mod 3 .
The map Φ is a graded homomorphism (of degree zero), because it acts degreewise Φ a · t k = a mod 3 · t k , and therefore, Φ A k B k . The standard kernel (41) cannot be defined, because the target algebra B 3 , 3 is zeroless (no zero as null-operation z B in its signature (56), and there is no relation (35) for Φ). However, the graded congruence kernel (43) can be defined as θ = ker θ Φ by the equivalence relation
x θ y Φ x = Φ y and deg x = deg y , x , y Z 6 Z .
Using (43) and (61), we obtain three congruence classes at each degree k
0 · t k θ = 0 · t k , 3 · t k , 1 · t k θ = 1 · t k , 4 · t k , 2 · t k θ = 2 · t k , 5 · t k ,
and so the graded quotient becomes
A 3 , 3 ker θ Φ = k 0 A k θ , A k θ Z 3 Z .
Therefore, there is the isomorphism of Z -graded ternary algebras
A 3 , 3 ker θ Φ im Φ ,
which preserves both the ternary algebra structure and the grading simultaneously.

5. Ternary Superalgebras

Let us consider examples of multiary ( n -ary) abelian grading groups G n of lowest order N in additive notation.
Example 4 
(Derived ternary superalgebra). The simplest example is the derived ternary algebra over the field k = R on two elements, which is derived from the binary algebra A 2 , 2 = 0 , 1 ν a 2 + , μ a 2 · , as follows:
A 2 , 3 = 0 , 1 ν a 2 + , μ a 3 μ a 2 2 ,
having the relations
μ a 3 0 , 0 , 0 = 0 , μ a 3 0 , 0 , 1 = 1 , μ a 3 0 , 1 , 1 = 0 , μ a 3 1 , 1 , 1 = 0 .
The direct sum decomposition (16) now is
A 2 , 3 = A 0 A 1 ,
where A 0 = a · 0 , A 1 = b · 1 , a , b k , and 0 , 1 G 2 Z 2 is the binary grading group.
Therefore, A 2 , 3 is Z 2 -graded derived ternary algebra or commutative ternary superalgebra:
μ a 3 A 0 , A 0 , A 0 A 0 , μ a 3 A 0 , A 0 , A 1 A 1 , μ a 3 A 0 , A 1 , A 1 A 0 , μ a 3 A 1 , A 1 , A 1 A 0 .
Define the mappings
Φ 0 = 0 , Φ 1 = c · 1 , c k , 0 , 1 A 2 , 3 ,
Ψ = id .
The mapping Φ preserves the grading (see (28))
Φ A 0 A 0 , Φ A 1 A 1 .
The only one nontrivial relation to show this follows from the second one in (67):
Φ μ a 3 0 , 0 , 1 = Φ 1 = c · 1 ,
μ a 3 Φ 0 , Φ 0 , Φ 1 = μ a 3 0 , 0 , c · 1 = c · 1 .
Thus, the pair Φ , Ψ is actually the (because of (72)) graded homomorphism of the ternary superalgebra A 2 , 3 .
A counterexample to Φ (70) is Φ n o t 0 = 0 + 1 , Φ n o t 1 = 1 , for which Φ n o t A 0 A 0 , and therefore, Φ n o t does not preserve grading.
The same construction can be made for any odd n, the arity of algebra multiplication, with only one nonzero product with exactly one “fermionic” variable μ a n 0 , , 0 n 1 , 1 = 1 (see (67)). This defines n-ary commutative superalgebra A 2 , n , and Φ , Ψ from (70) and (71) determines its graded homomorphism.
We are interested in strictly nonderived groups (or not reducible, meaning they cannot be reduced to any binary group, even with an automorphism), which exist for every n > 2 [32]. In general, if n -ary group has an idempotent (or identity), it is derived, and therefore the first condition to be not strictly derived is
gcd ( N , n 1 ) > 1 .
This follows from the condition of the neutral element e in G n as μ g n e , e , x = x written additively n 1 e + x = x mod N , which gives gcd ( N , n 1 ) = 1 , or N and n 1 are coprime.
Example 5 
(Nonderived ternary grading group). The only strictly nonderived ternary group with two elements is
G 3 = G 2 μ g 3 ,
μ g 3 x , y , z = x + y + z + 1 mod 2 , x , y , z G 2 .
It has gcd ( 2 , 2 ) = 2 , and so, no neutral element (identity) exists. The Cayley table for G 3 is
Axioms 15 00197 i001
The corresponding ternary algebra has the decomposition (16) in two parts ( G = N = 2 ), and so its addition is binary, because of (23) with m = 2 and m = 1 :
A 2 , 3 = A 0 A 1 ,
where A 0 and A 1 are “even” and “odd” components of the algebra. Using the Cayley Table (78), the conditions (18) in components now become
μ a 3 A 0 , A 0 , A 0 A 1 , μ a 3 A 0 , A 0 , A 1 A 0 , μ a 3 A 0 , A 1 , A 0 A 0 , μ a 3 A 0 , A 1 , A 1 A 1 , μ a 3 A 1 , A 0 , A 0 A 0 , μ a 3 A 1 , A 0 , A 1 A 1 , μ a 3 A 1 , A 1 , A 0 A 1 , μ a 3 A 1 , A 1 , A 1 A 0 ,
where μ a 3 is the ternary algebra multiplication, which is strictly nonderived and can be noncommutative.
Thus, the algebra A 2 , 3 (79) can be called a ternary (3-ary) superalgebra (even/odd parts in (79)) with ternary ( 3 -ary) grading. It can be compared with the ordinary (binary) superalgebra ( Z 2 -graded algebra), which is in our notation has the decomposition A 2 , 2 = A ν a 2 , μ a 2 = A 0 A 1 with the compatibility conditions
μ a 2 A 0 , A 0 A 0 , μ a 2 A 0 , A 1 A 1 , μ a 2 A 1 , A 0 A 1 , μ a 2 A 1 , A 1 A 0 .
Remark 5. 
In general, the affine ternary multiplication μ g 3 of the 3 -ary grading group G 3 can be generalized to any N and n as follows:
μ g n x 1 , x 2 , , x n = x 1 + x 2 + + x n + 1 mod N , x 1 , x 2 , , x n G N ,
which gives strictly the nonderived grading n -ary group, if the condition of absence of idempotents (75) holds valid. For instance, if N = 2 , then n should be odd, and the case of n = N + 1 works always.
Remark 6. 
For higher values of N and n , there exist strictly nonderived grading n -ary groups whose multiplication law differs from the affine form given in (82).

6. Z m , n -Graded Polynomials Over n -ary Matrices

The next example comes from polynomial rings k x in one indeterminate x over a field k graded by monomial degree d, such that the direct sum decomposition (16) is R = k x = d 0 R d , where the nonzero components are R d = c · x d , c k , d Z (for d < 0 , it is assumed c = 0 ). The elements from R d are homogeneous of degree d, since R d 1 R d 2 = , and the polynomial product is
R d 1 · R d 2 R d 1 + d 2 ,
which means that the the binary grading group G 2 now is the additive group of the ring of integers Z .
The polyadization of this grading group can be done by considering the additive group of the m , n -ring of polyadic integers Z m , n a , b consisting of the representatives of the congruence class a b , ( a , b Z + ) , which was introduced in [23,35]. Instead of an indeterminate x we will consider the block-shift matrices [23,36] which obey n-ary multiplication and binary addition.
Let us introduce n-ary “matrix indeterminates” as the block-shift matrices of n 1 × n 1 size
X = X x = X n x = M n 1 × n 1 n x = 0 x 0 0 0 0 x 0 0 0 0 x x 0 0 0 ,
which are closed under n-ary multiplication, which is strictly nonderived [36]. Without any additional requirements the set of n-ary matrices (84) form the totally commutative n-ary semigroup
M n = X μ x n ,
μ x n X x 1 , X x 2 , , X x n = X x 1 · X x 2 · · X x n ,
where the matrix product in the r.h.s. is in k . Obviously,
μ x n X x 1 , X x 2 , , X x n = X x 1 x 2 x n .
If x is invertible, then M n becomes an n-ary group with the querelement
X ¯ = X ¯ x = X x 2 n 0 x 2 n 0 0 0 0 x 2 n 0 0 0 0 x 2 n x 2 n 0 0 0 ,
μ x n X , X , , X n 1 , X ¯ = X , n 3 .
The polyadic identity in M n is
E n = X x 0 = X 1 ,
as
E n = 0 1 0 0 0 0 1 0 0 0 0 1 1 0 0 0 n 1 × n 1 I n = 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 n 1 × n 1 M n , n 3 ,
E 2 = I 2 = 1 0 0 1 ,
μ x n E n , E n , , E n n 1 , X x = X x , n 2 .
Due to the “quantization” (4), we can multiply only the admissible number of the matrix indeterminates, and the degree (word length of x’s) is also “quantized”:
d = d n = n 1 + 1 ,
where N 0 is the polyadic power (5). So, we have the polyadic monomials as polyadic powers (instead of x d )
X X d = X x d = M n 1 × n 1 n x d ,
X 0 = I n M n .
Remark 7. 
In the binary case n = 2 , the degree (94) becomes d = + 1 , and so, the zero polyadic power corresponds to one degree. Let informally = 1 ; then, in the general case, (94) is d 1 = 2 n . Thus, the free term (having zero degree d = 0 ) of a polynomial belongs to M n only in the binary case; see (91) and (96). Note that negative polyadic power is calculated for n-ary groups in the special way; that is, X 1 X ¯ [23]. Therefore, the free term in the n-ary case becomes c 0 · X x 0 = c 0 · E n (as for ordinary polynomial c 0 · x 0 = c 0 · 1 = c 0 ).
Thus, the generic polynomial over n-ary matrices of the length L + 1 with indeterminate x has the form
P n = P n x = c · E n + = 0 L c · X n x d = c · E n + c 0 · X n x + c 1 · X n x n + c 2 · X n x 2 n 1 + c · X n x n 1 + 1 + + c L · X n x L n 1 + 1 , c k .
As for ordinary polynomials, c i · X n x i c j · X n x j = , if i j , and therefore, the sum (97) is direct.
The polyadic matrix algebra corresponding to k X has the similar direct sum decomposition
A 2 , n = A 0 = 0 A d ,
where A 0 = c · E n , A d = c · M n 1 × n 1 n x d = c · X x d l see (95) and (97). Obviously, A d 1 A d 2 = , if l 1 l 2 , as in the binary case, and the n-ary multiplication is given by the ordinary matrix product in k :
μ a n a 1 , a 2 , , a n = a 1 · a 2 · · a n , a j A 2 , n .
Then, the n-ary product of components (17) becomes
μ a n A d 1 , A d 2 , , A d n A d , = 1 + 2 + + n .
Recall that the polyadic integers [35] are special representatives y k = a + k b of a congruence class a b = y k , k Z , b > 0 , 0 a b 1 , a , b Z + , which satisfy the “quantization” conditions (the arity shape invariants should be positive integers)
I m a , b = a b m 1 Z + ,
J n a , b = a b a n 1 1 Z + .
In this case only, the representatives form the strictly nonderived m , n -ring
Z m , n a , b = y k = a + k b ν m , μ n ,
ν m y 1 , y 2 , , y m = y 1 + y 2 + + y m ,
μ n y 1 , y 2 , , y n = y 1 · y 2 · · y n ,
which is a polyadic analog of the ring of ordinary integers Z = Z 2 , 2 0 , 1 , for which both shape invariants (101) and (102) vanish:
I m a , b = 0 , J n a , b = 0 Z m , n a , b = Z .
Now, we use the additive m -ary group of Z m , n a , b as the grading group G n for polyadic polynomials, by full analogy with the binary case (83). This means that the consistency condition of the grading (17) should be
μ a n A d 1 , A d 2 , , A d n A ν m y 1 , y 2 , , y m .
It follows from (107) that the arities of algebra A 2 , n multiplication and the grading ring Z m , n a , b addition (being the arity of the grading group G n ) coincide as
n = m = n .
We assume that every degree of the monomial c k · X d l k in A 2 , n is equal to the corresponding representative of the grading polyadic ring in (107), which gives the relations (together with (108))
d k = y k ,
k n 1 + 1 = a + b · k .
One set of solutions to (110) is given by ( n 3 )
a = 1 ,
b = n 1 ,
k = k .
This means that a polyadic algebra with given arity of multiplication n can be graded not by arbitrary polyadic integers, as in the binary case, but by those coming from the special polyadic rings Z n , n 1 , n 1 having the same arity of addition m = n , arbitrary arity of multiplication n and the fixed arity shape invariants (101) and (102):
I n 1 , n 1 = 1 ,
J n 1 , n 1 = 0 .
Example 6. 
Let us consider the concrete polynomial over 4-ary (block-shift) matrices with the indeterminate x, as
X = X 4 x = M 3 × 3 4 x = 0 x 0 0 0 x x 0 0 , E = E 6 = 0 1 0 0 0 1 1 0 0 ,
P = P 4 = 3 E 12 X 7 + 7 X 10 + 5 X 16 8 X 19 .
The degree (94) now becomes
d = d 4 = 3 + 1 .
The monomials are as follows: free constant term 3 E A 0 , 12 X 7 = 12 X d 2 A 10 = A d 2 has polyadic power = 2 , 7 X 10 = 7 X d 3 A 10 = A d 3 has polyadic power = 3 , 5 X 16 = 5 X d 5 A 19 = A d 5 has the polyadic power = 5 , and 8 X 19 = 8 X d 6 A 19 has the polyadic power = 6 . The sum (117) is direct, evidently, and so, we obtain the unique direct sum decomposition of the corresponding (to k X ) algebra
A 2 , 4 = A 0 A 7 A 10 A 16 A 19 = A 0 A d 2 A d 3 A d 5 A d 6 .
Then, we choose the grading polyadic ring (103) using (111)–(113) for a = 1 and b = 3 and take, for instance, Z 4 , 7 1 , 3 . The additive 4-ary group of this ring should be used to “add” the degrees, while multiplying 4 polynomials of the fixed degrees in (107). For instance, the main consistency condition (107) for all nonconstant graded components of the polynomial p 4 (117) has the form (using (110))
μ a 4 A d 2 , A d 3 , A d 5 , A d 6 A ν 4 1 + 3 · 2 , 1 + 3 · 3 , 1 + 3 · 5 , 1 + 3 · 6 = A 1 + 3 · 17 = A 52 ,
where on r.h.s. there are elements of the polyadic ring Z 4 , 7 1 , 3 .
Thus, the multiplication in the polyadic algebra A 2 , 4 (119), corresponding to the polynomial (117) over 4-ary matrices, respects the multiary grading by the polyadic ring Z 4 , 7 1 , 3 .

7. Higher Power Multiary Gradings

The compatibility condition (17) in the higher arity case can have a more complicated structure, leading to inequality n n instead of (20), if we use polyadic powers and the “quantization” of word length (4).
Definition 8. 
A multiary higher power G -graded polyadic k -algebra is the direct sum decomposition of k -vector spaces (16) such that the n-ary multiplication in the algebra respects the n -ary multiplication in the grading group as follows:
μ a n n A g 1 , A g 2 , , A g n n 1 + 1 A μ g n n g 1 , g 2 , , g n n 1 + 1 ,
where A g i is the ith component of the decomposition (16), while n and n are polyadic powers (5) of the algebra and the grading group multiplications, respectively.
A higher power polyadic algebra is strongly graded, if, in (121), the equality is
μ a n n A g 1 , A g 2 , , A g n n 1 + 1 = A μ g n n g 1 , g 2 , , g n n 1 + 1 .
Theorem 3. 
The arity of multiplication of the higher power polyadic algebra A m , n and the arity of the multiary grading group G n are “quantized” and connected by (cf. (20)), as follows:
n n 1 = n n 1 .
Proof. 
The definition of the polyadic power as the number of operations in their composition (4) follows from (121) and (122), and then, by equating the allowed word lengths, w = n n 1 + 1 = n n 1 + 1 in both sides. □
The solutions of (123) for n n , which are ≤ 5 together with the word length w, are
n n n n w 3 2 3 4 7 2 1 3 5 5 4 2 3 5 9 2 3 4 3 7 4 3 4 5 13 1 2 5 3 5 2 4 5 3 9 3 4 5 4 13
The “quantization” condition (123) together with table (124) shows that multiary gradings of higher arity polyadic algebras are possible only for certain specific combinations of arities and powers. In contrast, the binary case imposes no such restrictions.
Example 7. 
Let us consider the ternary grading group from Example 5 as in (76) and (77). To satisfy (123), we take the second solution in (124) n = 2 , n = 1 , n = 3 , n = 5 , which shows that the higher power polyadic algebra with binary addition (because of m = 2 in the decomposition (79)) should have 5-ary multiplication, and so, it is A 2 , 5 . Since n = 2 , the higher (third) polyadic power 3 -ary grading group multiplication becomes
μ g 3 2 x , y , z , t , u = x + y + z + t + u + 1 mod 2 , x , y , z , t , u G 2 .
The Cayley table of (125) is
Axioms 15 00197 i002
The corresponding polyadic algebra has the decomposition (16) in two parts ( G = N = 2 ):
A 2 , 5 = A 0 A 1 ,
where A 0 and A 1 are the “even” and “odd” components of the algebra. Using the Cayley table (126), the conditions (18) in components now become
μ a 5 A 0 , A 0 , A 0 , A 0 , A 0 A 1 , μ a 5 A 0 , A 0 , A 1 , A 0 , A 1 A 1 , μ a 5 A 0 , A 1 , A 0 , A 0 , A 0 A 0 , μ a 5 A 0 , A 1 , A 1 , A 0 , A 1 A 0 , μ a 5 A 1 , A 0 , A 0 , A 0 , A 0 A 0 , μ a 5 A 1 , A 0 , A 1 , A 0 , A 1 A 0 , μ a 5 A 1 , A 1 , A 0 , A 0 , A 0 A 1 , μ a 5 A 1 , A 1 , A 1 , A 0 , A 1 A 1 ,
μ a 5 A 0 , A 0 , A 0 , A 1 , A 0 A 0 , μ a 5 A 0 , A 0 , A 1 , A 1 , A 1 A 0 , μ a 5 A 0 , A 1 , A 0 , A 1 , A 0 A 1 , μ a 5 A 0 , A 1 , A 1 , A 1 , A 1 A 1 , μ a 5 A 1 , A 0 , A 0 , A 1 , A 0 A 1 , μ a 5 A 1 , A 0 , A 1 , A 1 , A 1 A 1 , μ a 5 A 1 , A 1 , A 0 , A 1 , A 0 A 0 , μ a 5 A 1 , A 1 , A 1 , A 1 , A 1 A 0 .
We call the algebra A 2 , 5 (128) a 5-ary superalgebra (even/odd parts in (127)) with higher (second) power ternary ( 3 -ary) grading (125).
Note that this 5-ary superalgebra (128) cannot be reduced to the ordinary (binary) superalgebra (81), because the ternary grading group G 3 is not strictly derived (not reduced to a binary group).

8. Conclusions

In this work, we have established a comprehensive framework for multiary graded polyadic algebras, extending classical grading theory to higher-arity algebraic structures. Our investigation has revealed several fundamentally new phenomena that distinguish the polyadic case from its binary counterpart.
Main contributions
1. General framework: We introduced the concept of multiary G -graded polyadic algebras, defined by the decomposition A [ m , n ] = g i G [ n ] A ( g i ) with the compatibility condition μ a [ n ] [ A ( g 1 ) , , A ( g n ) ] A ( μ g [ n ] [ g 1 , , g n ] ) . This definition accommodates arbitrary arities for both algebra operations and grading group operations.
2. Quantization rules: We discovered precise constraints connecting the arities:
  • For strongly G -graded algebras, the arity of graded group coincides with the multiplication arity of algebra n = n (Proposition 1).
  • The relation between the grading group order and the arity of the algebra addition is | G | = m ( m 1 ) + 1 (Theorem 1).
  • For higher power gradings, n ( n 1 ) = n ( n 1 ) (Theorem 3).
These “quantization” rules represent a distinctive feature of polyadic grading, with no analog in binary graded algebra theory.
3. Support properties: We established that for strongly G -graded polyadic algebras, the support satisfies supp ( A [ m , n ] ) = | G | , ensuring that all homogeneous components are nontrivial.
4. Graded homomorphisms: We developed the theory of polyadic graded homomorphisms as pairs ( Φ , Ψ ) , preserving both the algebraic structure and grading, with particular attention to cases where Ψ = id . The First Isomorphism Theorem for graded polyadic algebras is proved.
Key examples and applications
1. Ternary superalgebras: We constructed explicit examples including the following:
  • Derived ternary superalgebras with binary Z 2 -grading;
  • Strictly nonderived ternary superalgebras graded by ternary groups without identity (Example 5).
These examples demonstrate the possibility of grading by groups that lack neutral elements—a situation impossible in classical grading theory.
2. Polynomial algebras over n-ary matrices: We developed the theory of polynomials over block-shift matrices, showing they can be graded by polyadic integers Z [ m , n ] ( a , b ) with specific “quantization” conditions: a = 1 , b = n 1 , and k = k (Section 6).
3. Higher power gradings: We introduced the concept of higher power gradings where n n , providing explicit solutions to the “quantization” condition n ( n 1 ) = n ( n 1 ) and constructing a 5-ary superalgebra with ternary grading (Section 7).
Theoretical implications
1. Arity freedom with constraints: While initial arities can be chosen freely according to the arity freedom principle, meaningful grading structures impose specific constraints through “quantization” rules. This represents a natural selection mechanism for compatible arities in polyadic graded systems.
2. Role of identity elements: The classical requirement that grading groups contain an identity element e is relaxed in the polyadic setting. We have shown that meaningful gradings exist even when G [ n ] lacks such an element, as demonstrated by strictly nonderived ternary grading groups.
3. Support as structural invariant: The support of a graded polyadic algebra becomes a more delicate invariant than in the binary case, intimately connected with polyadic powers and word length “quantization”.
4. Nonderived operations: Our emphasis on strictly nonderived operations (Remark 1) ensures that the constructed examples are genuinely polyadic rather than disguised binary structures, revealing the essential features of higher arity.
Open problems and future directions
1. Classification problem: Classify all possible multiary gradings for given arities ( m , n ) and finite group orders | G | , including the enumeration of non-isomorphic graded structures.
2. Homological aspects: Develop homology and cohomology theories for multiary graded algebras, extending the classical theory of group cohomology for graded rings.
3. Representation theory: Investigate representations of multiary graded algebras, particularly the decomposition of modules into homogeneous components and the behavior of graded module categories.
4. Physical applications: Explore potential applications in theoretical physics, where
  • Ternary and higher-arity structures appear in Nambu mechanics and ternary “quantization”;
  • Higher power gradings might model symmetries in extended physical systems;
  • Polyadic superalgebras could provide mathematical frameworks for generalizations of supersymmetry.
5. Geometric realizations: Develop geometric interpretations of multiary graded algebras, potentially through noncommutative geometry or graded manifold theory extended to polyadic settings.
6. Connection with higher categories: Investigate relationships between multiary graded algebras and higher categorical structures, where composition laws themselves have higher arity.
7. Computational aspects: Develop algorithms for determining whether a given polyadic algebra admits nontrivial multiary gradings, and for classifying such gradings computationally.
Concluding remarks
The theory of multiary graded polyadic algebras represents a natural and rich extension of classical grading concepts to higher-arity algebraic structures. The “quantization” rules we have discovered reveal an intricate interplay between the arities of operations, the order of grading groups, and polyadic powers—a layer of structure absent in binary algebra.
The examples we have constructed, particularly the strictly nonderived cases, demonstrate that this generalization is not merely formal but yields genuinely new mathematical objects with interesting properties. The relaxation of requirements such as the existence of identity elements in grading groups opens new possibilities for algebraic structures.
As polyadic algebra continues to develop as a field [23,24], the theory of graded structures will likely play an increasingly important role, both in pure mathematics and in potential applications to physics and other sciences. The framework established here provides a solid foundation for these future developments, offering both concrete examples and general principles to guide further exploration.

Funding

This research received no external funding.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Năstăsescu, C.; Van Oystaeyen, F. Graded Ring Theory; Elsevier: Amsterdam, The Netherlands, 1982. [Google Scholar]
  2. Năstăsescu, C.; Van Oystaeyen, F. Methods of Graded Rings; Springer: Berlin/Heidelberg, Germany, 2004. [Google Scholar]
  3. Hazrat, R. Graded Rings and Graded Grothendieck Groups; Cambridge University Press: Cambridge, MA, USA, 2016. [Google Scholar]
  4. Rotman, J.J. Advanced Modern Algebra, 2nd ed.; AMS: Providence, RI, USA, 2010. [Google Scholar] [CrossRef]
  5. Lang, S. Algebra, 3rd ed.; Springer: New York, NY, USA, 2002; p. 914. [Google Scholar]
  6. Bahturin, Y.; Sehgal, S.; Zaicev, M. Group gradings on associative algebras. J. Algebra 2001, 241, 677–698. [Google Scholar] [CrossRef]
  7. Kelarev, A. Ring Constructions and Applications; World Scientific: Singapore, 2002. [Google Scholar]
  8. 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]
  9. Lam, T.Y. A First Course in Noncommutative Rings; Springer: New York, NY, USA, 1991. [Google Scholar] [CrossRef]
  10. Wess, J.; Bagger, J. Supersymmetry and Supergravity; Princeton University Press: Princeton, NJ, USA, 1983; p. 216. [Google Scholar]
  11. Deligne, P.; Etingof, P.; Freed, D.S.; Jeffrey, L.C.; Kazhdan, D.; Morgan, J.W.; Morrison, D.R.; Witten, E. (Eds.) Quantum Fields and Strings: A Cource for Mathematicians; American Mathematical Society: Providence, RI, USA, 1999; Volumes 1–2. [Google Scholar]
  12. Terning, J. Modern Supersymmetry; Oxford University Press: Oxford, UK, 2005; p. 336. [Google Scholar]
  13. Green, M.B.; Schwarz, J.H.; Witten, E. Superstring Theory; Cambridge University Press: Cambridge, MA, USA, 1987; Volumes 1–2. [Google Scholar]
  14. Kaku, M. Introduction to Superstrings and M-Theory; Springer: Berlin/Heidelberg, Germany, 1998; p. 587. [Google Scholar]
  15. Berezin, F.A. Introduction to Superanalysis; Reidel: Dordrecht, The Netherlands, 1987; p. 421. [Google Scholar]
  16. Kac, V.G. Lie superalgebras. Adv. Math. 1977, 26, 8–96. [Google Scholar] [CrossRef]
  17. Bernstein, J.; Leites, D.; Molotkov, V.; Shander, V. Algebra and calculus. In Seminars of Supersymmetries; MCCME: Moscow, Russia, 2013; Volume 1. [Google Scholar]
  18. Matsumura, H. On the graded rings of polynomials. J. Math. Soc. Jpn. 1959, 11, 17–27. [Google Scholar]
  19. Russell, P. Gradings of polynomial rings. In Proceedings of the Algebraic Geometry and Its Applications; Bajaj, C.L., Ed.; Springer: Berlin/Heidelberg, Germany, 1994; pp. 365–373. [Google Scholar] [CrossRef]
  20. Zalesskii, A.E.; Mikhalev, A.V. Group rings. J. Sov. Math. 1975, 4, 1–78. [Google Scholar] [CrossRef]
  21. Passman, D.S. The Algebraic Structure of Group Rings; John Wiley and Sons: Hoboken, NJ, USA, 1977; pp. xiv + 720. [Google Scholar]
  22. Bovdi, A.A. Group Rings; Uzgorod University: Uzhgorod, Ukraine, 1974; p. 118. [Google Scholar]
  23. Duplij, S. Polyadic Algebraic Structures; IOP Publishing: London, UK; Bristol, UK, 2022; p. 461. [Google Scholar] [CrossRef]
  24. Duplij, S. Higher power polyadic group rings. arXiv 2025, arXiv:2510.14029. [Google Scholar] [CrossRef]
  25. Sokhatsky, F.M. On the associativity of multiplace operations. Quasigroups Relat. Syst. 1997, 4, 51–66. [Google Scholar]
  26. Kumduang, T.; Wattanatripop, K. Partial algebras of formulas under generalized superpositions. Bull. Irkutsk State Univ. Ser. Math. 2025, 54, 160–175. [Google Scholar] [CrossRef]
  27. Sampson, M.; George, R. Semigroups in distributed computations: N-ary operations and irreducibility. Eur. J. Pure Appl. Math. 2026, 19, 7215. [Google Scholar] [CrossRef]
  28. Leeson, J.J.; Butson, A.T. On the general theory of (m, n) rings. Algebra Universalis 1980, 11, 42–76. [Google Scholar] [CrossRef]
  29. Duplij, S. Arity shape of polyadic algebraic structures. J. Math. Phys. Anal. Geom. 2019, 15, 3–56. [Google Scholar] [CrossRef]
  30. Post, E.L. Polyadic groups. Trans. Amer. Math. Soc. 1940, 48, 208–350. [Google Scholar] [CrossRef]
  31. Kasner, E. An extension of the group concept. Bull. Am. Math. Soc. 1904, 10, 290–291, Reported by L. G. Weld at 53rd Annual Meeting of AAAS, St. Louis, 1904. [Google Scholar] [CrossRef]
  32. Dörnte, W. Unterschungen über einen verallgemeinerten Gruppenbegriff. Math. Z. 1929, 29, 1–19. [Google Scholar] [CrossRef]
  33. Boboc, C.; Dăscălescu, S.; van Wyk, L. Cyclic algebras, symbol algebras and gradings on matrices. Linear Algebra Appl. 2024, 688, 157–178. [Google Scholar] [CrossRef]
  34. Cohn, P.M. Universal Algebra; Harper & Row: New York, NY, USA, 1965; p. 352. [Google Scholar]
  35. Duplij, S. Polyadic integer numbers and finite (m, n)-fields. P-Adic Numbers, Ultrametric Anal. Appl. 2017, 9, 257–281. [Google Scholar] [CrossRef]
  36. Duplij, S. Polyadization of algebraic structures. Symmetry 2022, 14, 1782. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.