Skip to Content
AxiomsAxioms
  • Article
  • Open Access

15 May 2026

18 Pages

Higher Power Polyadic Group Rings

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
This article belongs to the Section Algebra and Number Theory

Abstract

This paper introduces and systematically develops the theory of polyadic group rings, a higher arity generalization of classical group rings. We construct the fundamental operations of these structures, defining the m-ary addition and n-ary multiplication for a polyadic group ring built from an ( m r , n r ) -ring and an n g -ary group. A central result is the derivation of the “quantization” conditions that interrelate these arities, governed by the arity freedom principle, which also extends to operations with higher polyadic powers. We establish key algebraic properties, including conditions for total associativity and the existence of a zero element and identity. The concepts of the polyadic augmentation map and augmentation ideal are generalized, providing a bridge to the classical theory. The framework is illustrated with explicit examples, solidifying the theoretical constructions.
MSC:
11A07; 11A67; 16S34; 17A40; 17A42; 20N15; 20C05

1. Introduction

The theory of group rings, which constructs a ring R [ G ] from a given ring R and a group G , is a cornerstone of modern algebra. Its applications permeate various fields, including representation theory, homological algebra, and algebraic topology [1,2,3]. The standard construction leverages the binary operations of the constituent ring and group to define an associative algebra, providing a rich framework for studying the interplay between ring-theoretic and group-theoretic properties [4,5,6].
A significant and modern generalization of classical algebraic structures arises from increasing the arity of their fundamental operations. This leads to the theory of polyadic algebraic structures [7,8], where operations map n elements to a single one, with n ≥ 3 . This framework reveals phenomena absent in the binary case; for instance, polyadic groups (n-ary groups) can exist without a unique identity element or inverses in the classical sense, with their structure governed by the more general concept of a querelement [7]. Similarly, polyadic rings, defined by an m-ary addition and an n-ary multiplication linked by generalized distributivity laws, exhibit a more complex and nuanced structure [9].
While the theories of binary group rings and polyadic structures are individually well-established, the synthesis of the theory of polyadic group rings remains largely unexplored. Constructing such an object, denoted R [ m r , n r ] [ G [ n g ] ] from an ( m r , n r ) -ring and an n g -ary group, presents fundamental challenges. The arities of the initial structures are not independent; they are constrained by the requirement that the resulting object must itself be a ring-like structure with well-defined m r -ary addition and n r -ary multiplication. This interplay is governed by what has been termed the “arity freedom principle” [10], leading to “quantization” conditions that determine the admissible arities m r and n r of the resulting polyadic group ring. In an earlier study, a special case of polyadic group rings, where m r = 2 and n r = 2 , known as the n-group ring, with the binary initial ring R = R [ 2 , 2 ] , was briefly considered in [11,12,13].
In this article, we introduce and develop the theory of polyadic group rings for the first time with the general initial (polyadic) ( m r , n r ) -ring R [ m r , n r ] . Our primary objective is to generalize the classical group ring construction to the higher-arity setting and establish its foundational properties. The main contributions of this work are as follows:
  • We provide a rigorous definition of a polyadic group ring, formally constructing its m r -ary addition and n r -ary multiplication operations, carefully accounting for the arities of the underlying ring and group.
  • We derive the precise “quantization” conditions that link the arities ( m r , n r ) of the group ring to the arities ( m r , n r ) of the initial ring and n g of the initial group, including the novel case of operations with higher polyadic powers.
  • We establish key properties of these structures, proving under which conditions the polyadic group ring is totally associative and possesses analogs of a zero element and, when applicable, an identity.
  • We define and investigate the concepts of the polyadic augmentation map and the polyadic augmentation ideal, generalizing central tools from the classical theory.
  • We illustrate the theory with concrete, non-trivial examples involving nonderived polyadic rings and finite polyadic groups, explicitly computing products and demonstrating the workings of the constructed operations.
This work not only broadens the landscape of ring theory by introducing a new class of algebraic objects but also provides a framework for future investigations into their representation theory, homological invariants, graded rings and algebras. For instance, in [14], a comprehensive theory of multiary graded polyadic algebras, extending the classical concept of group-graded algebras to higher-arity structures, was developed. Furthermore, the complex, non-binary operations inherent to polyadic group rings present a promising algebraic platform for applications in coding theory [15,16] and post-quantum cryptography [17]. A compelling demonstration of this practical potential can be found in [18,19]. The authors construct a novel encryption and decryption procedure that directly leverages polyadic algebraic structures alongside signal processing methods [20], which represents a tangible and promising application of polyadic theory to cryptography, moving beyond purely theoretical constructs.

2. Preliminaries

Here we present the notation and the general properties of polyadic structures (for more details and references, consult [10]).
Let S × n be the n-fold Cartesian product of a non-empty set S. Elements of the form ( x 1 , … , x n ) ∈ S × n are termed polyads or n-tuples ( x ) . An n-tuple consisting of identical elements is denoted ( x n ) . A polyadic operation (or n-ary operation) is defined as a mapping μ n : S × n → S , denoted by μ n [ x ] . A polyadic structure ⟨ S ∣ μ n i ⟩ consists of a set S that is closed under a family of polyadic operations μ n i .
The fundamental one-operation polyadic structure is the n-ary magma M = ⟨ S ∣ μ n ⟩ . The imposition of additional axioms results in various group-like structures. For instance, a polyadically associative magma constitutes an n-ary semigroup S n = ⟨ S ∣ μ n ∣ a s s o c ⟩ . Polyadic associativity is defined through the invariance relation μ n [ x , μ n [ y ] , z ] = i n v a r i a n t , wherein the embedded multiplication may appear in any of the n − 1 positions (resulting in n − 1 relations), which enables the omission of parentheses in compositions. The polyads x ,   y ,   z have appropriate lengths such that the total number of elements is 2 n − 1 . This iterated product
μ n ∘ ℓ μ [ x ] = μ n [ μ n [ … μ n [ x ] ] ] ︷ ℓ μ , x ∈ S ℓ μ ( n − 1 ) + 1 ,
where ℓ μ denotes the number of multiplication operations. From (1), a fundamental distinction between polyadic and conventional binary ( n = 2 ) structures arises: the length of a word in a composition of n-ary multiplications is not arbitrary but “quantized”, assuming only the following admissible values are possible:
L admiss ( n , ℓ μ ) = ℓ μ ( n − 1 ) + 1 .
This viewpoint facilitates the classification of polyadic operations into two categories: those iterated from binary or lower-arity operations and those that are noniterated, or equivalently, derived and nonderived. For instance, the ternary product μ 3 + [ x , y , z ] = x y z on positive integers Z + is derived since it equals to the composition μ 3 + = μ 2 ∘ μ 2 of binary products μ 2 μ 2 x , y , z = x · y · z . On negative numbers Z − , however, the ternary multiplication μ 3 − is nonderived: two negatives multiply to a positive, breaking closure under binary multiplication, so the above binary iteration fails. Ternary associativity holds for both, making S 3 + = Z + ∣ μ 3 + and S 3 − = Z − ∣ μ 3 − ternary semigroups, but only S 3 − is nonderived. Below we consider only nonderived polyadic operations and structures.
We now recall the definitions of key elements in polyadic structures. For an element x ∈ S , its ℓ μ -polyadic power (or higher polyadic power) is defined by
x ⟨ ℓ μ ⟩ = μ n ∘ ℓ μ [ x ℓ μ ( n − 1 ) + 1 ] ,
which, in the binary case n = 2 , yields x ⟨ ℓ μ ⟩ = x ℓ μ + 1 , differing by unity from the conventional power.
A polyadic idempotent x i d (if existent) satisfies
x i d ⟨ ℓ μ ⟩ = x i d , x i d ∈ S .
A polyadic zero z is uniquely defined by the n − 1 conditions
μ n [ z , x ] = z , x ∈ S n − 1 ,
with z positioned in any of the n argument slots. A polyadic nilpotent element x n i l is defined by
x n i l ⟨ ℓ μ ⟩ = z , x n i l ∈ S .
A neutral ( n − 1 ) -polyad e satisfies
μ n [ x , e ] = x , e ∈ S n − 1 ,
which is typically non-unique. If all components of the neutral polyad are identical, e = e n − 1 , then
μ n [ x , e n − 1 ] = x ,
and e is termed an identity of ⟨ S ∣ μ n ⟩ ; it may appear in any of the n positions within the operation. From (5) with x = z n − 1 and (8) with x = e , it follows that both the polyadic zero z and the identity e are idempotents satisfying (4). Certain exotic polyadic structures may lack idempotents, a zero, or an identity altogether, or may feature multiple identities [10].
In the polyadic case ( n ≥ 3 ), the notion of invertibility is not linked to the identity (8) but is determined by the querelement x ¯ = x ¯ ( x ) , defined via the n − 1 relations [7]
μ n [ x ¯ , x n − 1 ] = x , x ∈ S ,
which must hold for x ¯ in each of the n possible positions. Such an element x is termed polyadically invertible. If every element of an n-ary semigroup S n is polyadically invertible, then S n constitutes an n-ary (polyadic) group G n = ⟨ S ∣ μ n ∣ a s s o c ⟩ . Notably, the presence of an identity is not a prerequisite for polyadic groups.
Structures endowed with two polyadic operations fall within the class of ring-like polyadic structures [9]. A polyadic ring, or ( m , n ) -ring, R m , n = ⟨ S ∣ ν m , μ n ⟩ , consists of a non-empty set S equipped with an m-ary addition ν m : S m → S and an n-ary multiplication μ n : S n → S , such that: ⟨ S ∣ ν m ∣ a s s o c ∣ c o m m ⟩ forms an m-ary commutative group and ⟨ S ∣ μ n ∣ a s s o c ⟩ forms an n-ary semigroup. The operations ν m and μ n are interconnected by the following n-ary distributivity relations [10]:
μ n [ ν m [ x 1 , … , x m ] , y 2 , y 3 , … , y n ] = ν m [ μ n [ x 1 , y 2 , y 3 , … , y n ] , μ n [ x 2 , y 2 , y 3 , … , y n ] , … , μ n [ x m , y 2 , y 3 , … , y n ] ] ,
μ n [ y 1 , ν m [ x 1 , … , x m ] , y 3 , … , y n ] = ν m [ μ n [ y 1 , x 1 , y 3 , … , y n ] , μ n [ y 1 , x 2 , y 3 , … , y n ] , … , μ n [ y 1 , x m , y 3 , … , y n ] ] ,
⋮ μ n [ y 1 , y 2 , … , y n − 1 , ν m [ x 1 , … , x m ] ] = ν m [ μ n [ y 1 , y 2 , … , y n − 1 , x 1 ] , μ n [ y 1 , y 2 , … , y n − 1 , x 2 ] , … , μ n [ y 1 , y 2 , … , y n − 1 , x m ] ] ,
where x i , y j ∈ S , i = 1 , … , m , j = 1 , … , n .
If not all distributivity relations (10)–(12) or associativity relations hold, the ring is designated as partial (in contrast to total), giving rise to a multitude of possible polyadic ring variants. Further details are in [10].

3. Binary Group Rings

Here recall in brief the main constructions of the binary group rings in the standard approach [1,2,3,21,22] and then present them in the “polyadic” language, which will make their generalization to the novel higher arity approach more clear and transparent.
The most natural way to construct from two given one-set algebraic structures A 1 and B 1 a new two-set algebraic structure C 2 is to consider formal combinations of elements from B 1 having “weights” from A 1 is “more linear”, which is usually denoted A 1 B 1 . Without considering a product in A 1 B 1 the result is only a free module-like structure in which A 1 plays a role of “scalars”, while B 1 being the “basis”, taking the starting analogy with a vector space. Further various definitions of a multiplication in A 1 B 1 lead to different algebra-like structures with nontrivial properties, which are usually denoted as C 2 = A 1 B 1 . An equivalent approach to the latter is consideration of the set of mappings B 1 → A 1 formally multiplied by “scalars” from A 1 with the pointwise addition and the product as a convolution, commonly denoted as A 1 B 1 . We will exploit the first definition for higher arity generalizations. Typically, the role of “scalars” from A 1 is played by rings, fields, etc., and for the role of “vectors” from B 1 one takes semigroups, monoids, groups, loops, and so on.
In the simplest case, A 1 is an associative ring R (having the underlying set R, with the possible zero 0 R and unit 1 R ), and B 1 is a group G (having the underlying set G, with the identity e G ), and R G can be built as follows (in the standard notation [2,21,22]).
Definition 1.
A free R -module R G with the basis g ∣ g ∈ G is the set of finite formal sums
∑ g ∈ G r g · g , r g ∈ R , g ∈ G ,
which endowed with the left-“componentwise” addition
∑ g ∈ G r g · g + ∑ g ∈ G r g ′ · g = ∑ g ∈ G r g + r g ′ · g
and left-“scalar” multiplication
λ ∑ g ∈ G r g · g = ∑ g ∈ G λ r g · g , λ ∈ R .
Obviously, G ⊂ R G , because for every h ∈ G one can choose r h = 1 R and r g = 0 R , if g ≠ h . Thus, each element of R G can be treated as a finite sum of such r g · g for which r g ≠ 0 , and the subset of such g ∈ G supp ⊂ G is the support of ∑ r g · g , i.e., G supp = support ∑ r g · g . In general, if both underlying sets R and G are finite with R = N R and G = N G , the total number of elements in R G = N R G is N R G = N R N G .
The product of sums (13) cannot be defined in left-“componentwise” way analogously to the addition (14) simply by replacing addition with multiplication in the ring, e.g., ∑ g ∈ G r g r g ′ · g , since this entirely ignores the group structure. Instead, consider the both-“componentwise” product of two terms of different sums (13) and define their product by the natural way r g · g r h ′ · h = r g r h ′ · gh . Then the multiplication of elements from R G can be presented as follows (after reordering the terms)
∑ g ∈ G r g · g ∑ h ∈ G r h ′ · h = ∑ g ∈ G ∑ h ∈ G r g r h ′ · gh = ∑ u ∈ G r u ″ · u ,
where
r u ″ = ∑ g ∈ G ∑ h ∈ G r g r h ′ | gh = u , g , h , u ∈ G ,
or in terms of one sum
r u ″ = ∑ g ∈ G r g r g − 1 u ′ .
The product (16) is associative and satisfies distributivity with respect to the addition (14).
Definition 2.
The free module R G (13)–(15) endowed with the product (16)–(17) becomes a ring which is called a group ring denoted by R = R G .
If the initial ring is a field R = K , then K G is called a group algebra over K , being a vector space over K with the dimension G , if the group G is finite. Note that the group algebra concept is the starting point for representation theory (see, e.g., [23,24,25]).
Numerous properties of group rings were considered in [1,2,3,21,22], and refs therein.
Let us rewrite the main definitions of the binary group rings (13)–(17) in the more detail “polyadic” functional notation by writing the operations manifestly.
The initial (binary) group is the algebraic structure having one-set g = G and one main associative binary operation μ G = μ G 2 : G × G → G , as G = G 2 = G ∣ μ G 2 , (   ) − 1 together with the identity e G satisfying μ G e G , g = μ G g , e G = g and the inverse (   ) − 1 such that μ G g , g − 1 = μ G g − 1 , g = e G for all g ∈ G . The initial ring R is the one-set r = R algebraic structure R = R 2 , 2 = R ∣ ν R 2 , μ R 2 endowed by two binary operations: addition ν R = ν R 2 : R × R → R and multiplication μ R = μ R 2 : R × R → R which satisfy distributivity, such that R ∣ ν R 2 is the additive semigroup, and R ∣ μ R 2 is the multiplicative group.
Note that by (15) a new operation (scalar multiplication) in R G is quietly defined, which is possible, because any ring is a module over itself. Therefore, at first glance, the resulting group ring R G is a 2-set and 4-operation algebraic structure, but we will see that it is more complicated.
Using this notation we present the definition (13)–(17) of the group ring R = R G in the “polyadic” functional form. Instead of the abstract sum ∑ in (13) we use the concrete summation Σ by indices manifestly (see, e.g., [21]).
In this way, the α th element r α of the group ring R = R G (with the underlying set R) can be written as the formal sum
r α = r r → g → α , g → = Σ i r g i α · g i , r g i α ∈ R , g i ∈ G , r α ∈ R ,
where r g i α are ring elements and g i are group elements. For conciseness, we denote the ordered families r → g → α = r g 1 α , r g 2 α , … , g → = g 1 , g 2 , … as “formal vectors”. In case the group ring R G is finite, α = 1 , 2 … R .
Denote the binary addition in R = R G (14) as ν R 2 : R × R → R , then
ν R 2 r r → g → α 1 , g → , r r → g ~ α 2 , g → = Σ i ν R 2 r g i α 1 , r g i α 2 · g i , r g i α 1 , 2 ∈ R , g i ∈ G .
The binary multiplication in R = R G is denoted by μ R 2 : R × R → R , using (16) we define the convolution-like operation
μ R 2 r r → g → α 1 , g → , r r → g ~ α 2 , g → = Σ i Σ j μ R 2 r g i α 1 , r g j α 2 · μ G 2 g i , g j , r g i , j α 1 , 2 ∈ R , g i ∈ G .
Denote
g k = μ G 2 g i , g j , k = k i , j , g i , j , k ∈ G ,
then (16) “in components” takes the form
μ R 2 r r → g → α 1 , g → , r r → g → α 2 , g → = Σ i Σ j μ R 2 r g i α 1 , r g j α 2 · g k i . j , r g i , j , k i , j α 1 , 2 ∈ R , g i ∈ G .
We can resolve (22) with respect to g j , reorder indices and present (21) as follows
μ R 2 r r → g → α 1 , g → , r r → g → α 2 , g → = Σ k r g k ′ α 1 , α 2 · g k ,
where
r g k ′ α 1 , α 2 = Σ i μ R 2 r g i α 1 , r g i − 1 g k α 2 ,
which is the component/function version of (18).
The set of sums (19) r = R together with associative addition (20) and multiplication (21) being distributive is the standard ring R ∣ v R 2 , μ R 2 . However, the group ring R G is more than a ring, because by definition it has the additional module-like operation, the “scalar” multiplication (15). Since the “scalars” are from the initial ring R , it is an internal ring product, because every ring is a module by itself. But for the group ring R G (15) is the unnoticed new operation (1-place action or R -module) ρ R 1 : R × R → R , which is in the “polyadic” notation becomes (for k-place actions, see [10])
ρ R 1 λ ∣ r r → g → α , g → = Σ i μ R 2 λ , r g i α · g i , λ , r g i α ∈ R , g i ∈ G .
In this way, we could think that the formal “polyadic” definition of the group ring, as 2 set and 3 operation algebraic structure R = R , R , G ∣ ν R 2 , μ R 2 , ρ R 1 , λ ∈ R . Nevertheless, after adding the operations (addition ν R 2 and multiplication μ R 2 ) in R , we have (by classification of [10]).
Definition 3.
The binary group ring R G is the 3 set and 6 operation algebra-like structure
R = R , R , G ∣ ν R 2 , μ R 2 , ρ R 1 ∣ ν R 2 , μ R 2 ∣ μ G 2 ,
where the first 3 operations are defined in (20), (21) and (26), respectively.

4. Polyadic Group Rings

Now we generalize the group ring concept to higher arity case and introduce a novel algebraic structure, the polyadic group ring. By doing so, we take advantage of the “arity freedom principle” [10]: in any algebraic structure, initial arities of all its operations can be taken arbitrary, then the structural constraints appear from the general dependences leading to “quantization rules” which forbidden certain combination of arities. In this way, polyadic structures can have exotic properties, for instance n-ary groups without identity or with many identities, polyadic fields without zero or/and without unit, and so on [10], which leads to revision even standard theorems and statements.
In the abstract setting from beginning of the previous section, the initial polyadic algebraic structures now carry arbitrary arities A a r i t y A 1 and B a r i t y B 1 . Then the resulting polyadic algebra-like structure C a r i t y C ( 2 ) = A a r i t y A 1 B a r i t y B 1 will possess the specific arity a r i t y C which is determined by the operations framework.
So instead of the binary ring R as A 1 and group G as B 1 , we consider n r , m r -ring R m r , n r as A a r i t y A 1 and n g -ary group G n g as B a r i t y B 1 , where
R m r , n r = R ∣ ν R m r , μ R n r ,
with totally associative m r -ary addition ν R m r : R × m r → R and n r -ary multiplication μ R n r : R × n r → R , which satisfy polyadic distributivity.
If polyadic zero z R and polyadic identity (or unity) e R in R m r , n r exist, they satisfy additive neutrality and multiplicative absorption, and multiplicative neutrality, respectively
ν R m r r , z R , … , z R ︷ m r − 1 = r ,
μ R m r r 1 , r 2 , … , r m r − 1 , z R = z R
μ R n r r , e R , … , e R ︷ n r − 1 = r , r , r i , z R , e R ∈ R ,
where z R and e R can be on any places. The polyadic zero z R in R m r , n r is not necessary for R ∣ ν R m r to be a m r -ary additive group for m r ≥ 3 (which is impossible for binary groups), but the additive querelement is important [26]. Nevertheless, one can adjoin the extraneous polyadic zero z ˙ R ∉ R externally by extending the underlying set R of the initial ring R m r , n r as follows
R ˙ = R ∪ z ˙ R ,
where z ˙ R satisfies the needed standard relations (29) and (30).
The neutral element e R being a polyadic identity, has nothing with the multiplicative invertibility in the ring R m r , n r . Nevertheless, some elements of R m r , n r can be invertible, which means that for them there exists a polyadic analog of multiplicative inverse, the querelement r ¯ defined by [7]
μ R n r r ¯ , r , … , r ︷ n r − 1 = r , r ¯ , r ∈ R ,
where r ¯ can be on any place and n r ≥ 3 . By analogy with the binary ring, a polyadic ring without unity can be called a polyadic rng, a non-unital polyadic ring or pseudo-ring. The simplest n r , m r -rng example is 2 Z .
We denote in R m r , n r the subset of multiplicatively invertible elements (sometimes called units) by U R ⊂ R which, in the binary case, is called a unit group U n u R m r , n r . In the polyadic case the set U n u should be the n u -ary group with n u = n r .
The n g -ary group is
G n g = G ∣ μ G n g , (   ) ¯ ,
with n g -ary multiplication n g : G × n g → G , and each element g has the analog of inverse, its querelement g ¯ obeying
μ G g ¯ , g , … , g ︷ n g − 1 = g , g ¯ , g ∈ G ,
where g ¯ can be on any place.
If in G n g the polyadic identity e G exists (which is not necessary for n g ≥ 3 ), it satisfies multiplicative neutrality
μ G g , e G , … , e G ︷ n g − 1 = g , e G , g ∈ G ,
where g can be on any place. For more details and definitions, see [10].
Let us construct from m r , n r -ring R m r , n r (28) and n g -ary group G n g (34) the polyadic group ring R m r , n r with the same underlying set of the formal sums (19) R = r
R m r , n r = R n r , m r G n g ,
but now obeying m r -ary addition ν m r : R × m r → R and n r -ary multiplication μ n r : R × n r → R . Using the “arity freedom principle” [10] and analogy with the binary case (27) we have
Definition 4.
The polyadic group ring is the 3 set and 6 operation polyadic algebra-like structure
R m r , n r = R , R , G ∣ ν R m r , μ R n r , ρ R k ρ ∣ ν R m r , μ R n r ∣ μ G n g ,
where μ G n g is n g -ary multiplication of the initial group G n g (with the underlying set G), ν R m r and μ R n r are m r -ary addition and n r -ary multiplication of the initial polyadic ring R n r , m r (with the underlying set R), ν R m r , μ R n r and ρ R k ρ are ν R m r -ary addition, μ R n r -ary multiplication and k ρ -ary multiplication on scalar of the polyadic group ring R m r , n r (with the underlying set R).
Now we generalize the binary operations ν R 2 (20), μ R 2 (21) and ρ R 1 (26) to higher arity setting, implying that the arities of initial m r , n r -ring R m r , n r (28) and n g -ary group G n g (34) are given.
Definition 5.
The m r -ary addition ν m r can be defined by analogy with (20) left-“componentwise” by
ν R m r r r → g → α 1 , g → , … , r r → g ~ α m r , g → = Σ i ν R m r r g i α 1 , … , r g i α m r · g i , r g i α 1 , … , m r ∈ R , g i ∈ G , r r → g → α 1 , … , m r , g → ∈ R .
Proposition 1.
The arity of addition in the polyadic group ring R m r , n r coincides with the arity of addition in the initial polyadic ring R n r , m r that is
m r = m r ,
if in both sides of (39) there is one polyadic operation (addition in R m r , n r and addition in R m r , n r ).
Proof. 
The statement (40) directly follows from the construction (39). □
Remark 1.
In the polyadic framework and from “arity freedom principle” [10], it follows that number of operations in both sides of (39) can be different, such that the arities of addition in the initial ring and the group ring may also differ, but the total number of ring elements in brackets should remain the same.
Remark 2.
Denote the number of m r -ary additions in the initial m r , n r -ring R m r , n r by ℓ m , being actually the polyadic power, and their composition by ν R m r ∘ ℓ m , where the total number of arguments is not arbitrary, as in the binary case, but “quantized” becoming
ℓ m m r − 1 + 1 ,
which directly follows from the general form of admissible length of words appearing in composition of higher arity operations (2).
Definition 6.
The higher (polyadic) power m r -ary addition in the polyadic group ring R m r , n r can be defined by analogy with (39) left-“componentwise” by
ν R m r r r → g → α 1 , g → , … , r r → g → α m r , g → = Σ i ν R m r ∘ ℓ m r g i α 1 , … , r g i α ℓ m m r − 1 + 1 · g i , r g i α 1 , … , ℓ m m r − 1 + 1 ∈ R , g i ∈ G , r r → g → α 1 , … , m r , g → ∈ R .
Therefore, we have
Theorem 1.
The arity of addition m r in the polyadic group ring R m r , n r which possesses a higher polyadic power of m r -ary addition is
m r = ℓ m m r − 1 + 1 .
Proof. 
The statement (43) follows from the construction (42), Remarks 1, 2 and the “quantization” condition (41). □
The multiplication in R m r , n r can be defined similarly to the binary case in functional notation (21)
Definition 7.
In the polyadic group ring R m r , n r G n g (37) the multiplication μ R n r : R × n r → R can be defined by the both-“componentwise” convolution-like operation
μ R n r r r → g → α 1 , g → , … , r r → g → α n r , g → = Σ i 1 … Σ i n r Σ j 1 … Σ j n g μ R n r r g i 1 α 1 , … , r g i n r α n r · μ G n g g j 1 , … , g j n g , r g i α j ∈ R , g i ∈ G , r r → g → α j , g → ∈ R ,
if polyadic power of all operations is 1.
Proposition 2.
The arities of multiplications defined by (44) in R n r , m r , G n g and R m r , n r coincide
n r = n r = n g .
Proof. 
The statement (45) follows directly from both-“componentwise” convolution (44). □
The construction of the multiplication is more elaborate and interesting, if we take into account Remarks 1 and 2 and use the “arity freedom principle” [10] (initial arities are taken arbitrary). Indeed, let us denote polyadic powers of μ R n r and μ G n g by ℓ n and ℓ g , correspondingly, then we have
Definition 8.
The polyadic group ring with higher polyadic power of multiplications is defined by
μ R n r r r → g → α 1 , g → , … , r r → g → α n r , g → = Σ i 1 … Σ ℓ n n r − 1 + 1 Σ j 1 … Σ ℓ g n g − 1 + 1 μ R n r ∘ ℓ n r g i 1 α 1 , … , r g i ℓ n n r − 1 + 1 α ℓ n n r − 1 + 1 · μ G n g ℓ n g g j 1 , … , g j ℓ g n g − 1 + 1 , r g i α j ∈ R , g i ∈ G , r r → g → α j , g → ∈ R .
The “quantization” conditions for multiplications in R n r , m r and G n g , analogous to those for additions in (41), now arise from the equality of the total number of arguments in the Equation (46).
ℓ n n r − 1 + 1 = ℓ g n g − 1 + 1 .
Because each r g i α j ∈ R corresponds to one g i ∈ G in (46), their amount (or word lengths, see the general word size (2)) should be the same, while they enter into the different operations: n r -ary ring multiplication with polyadic power ℓ n and n g -ary group multiplication with polyadic power ℓ g (see (3)).
Thus, we have
Theorem 2.
The arity of multiplication n r in the polyadic group ring R m r , n r (with higher polyadic powers of multiplications in the initial polyadic ring μ R n r and the n g -ary group μ G n g ) is
n r = ℓ n n r − 1 + 1 = ℓ g n g − 1 + 1 .
Proof. 
The statement (48) follows from the construction (46) and the “quantization” condition (47). □
Obviously, if all polyadic powers are equal to one ℓ n = ℓ g = 1 , then all operations share the same arity (45).
Definition 9.
The polyadic group ring R m r , n r = R m r , n r G n g (37) which has initial multiplications μ R n r and μ G n g of higher polyadic powers (46), is called a higher power polyadic group ring.

5. Properties

Here we consider basic properties of the polyadic group rings, which are in the higher arity case can be unusual and exotic.
In the binary case, the associativity of addition of the group ring R G trivially follows from the associativity of addition in the initial ring R because of the the left-“componentwise” addition (14). The same conclusion is valid for polyadic additions ν R m r and ν R m r with unit polyadic power (39).
Proposition 3.
In case of higher polyadic powers (42) ℓ m > 1 the total associativity of addition in the polyadic group ring R m r , n r follows from the associativity of the addition in the initial ring R m r , n r , if the strong inequality takes place
m r > m r .
Proof. 
It follows from the “quantization” condition (41) and the obvious fact that in the same structure lower arity parentheses are inserted into higher arity ones, which is informally can be treated as “larger brackets can be constructed from smaller brackets”. □
The connection between associativities of multiplications is more complicated to prove.
Theorem 3.
If the multiplication in the initial ring R m r , n r is totally polyadic associative, then the polyadic group ring R m r , n r is totally associative multiplicatively, when all the arities of multiplication are equal
n r = n r = n g .
Proof. 
Using (44) in the notation (19), we compute n r terms in the total associativity
(51) r β 1 = Σ μ R n r μ R n r r α 1 , … , r α n r , r α n r + 1 , … , r α 2 n r − 1 , (52) r β 2 = Σ μ R n r r α 1 , μ R n r r α 2 , … , r α n r + 1 , r α n r + 2 , … , r α 2 n r − 1 , ⋮ (53) r β n r = Σ μ R n r r α 1 , … , r α n r − 1 , μ R n r r α n r , … , r α 2 n r − 1 ,
where Σ denotes the sum by all corresponding internal indices. Then we take into account the both-“componentwise” convolution and total associativity of n g -ary group G n g to obtain
r β 1 = Σ μ R n r μ R n r r g i 1 α 1 , … , r g i n r α n r , r g i n r + 1 α n r + 1 , … , r g 2 i n r − 1 α 2 n r − 1
· μ G n g ∘ 2 g j 1 , … , g 2 j n g + 1 ,
r β 2 = Σ μ R n r r g i 1 α 1 , μ R n r r g i 2 α 2 … , r g i n r + 1 α n r + 1 , r g i n r + 2 α n r + 2 , … , r g 2 i n r − 1 α 2 n r − 1
· μ G n g ∘ 2 g j 1 , … , g 2 j n g + 1 ,
⋮
r β n r = Σ μ R n r r g i 1 α 1 , … , r g i n r − 1 α n r − 1 , μ R n r r g i n r α n r , … , r g 2 i n r − 1 α 2 n r − 1
· μ G n g ∘ 2 g j 1 , … , g 2 j n g + 1 ,
where the (group dependence) terms on r.h.s. of the formal product · coincide after suitable rename of the summation indices. All the terms on the l.h.s. are equal due to the total polyadic associativity in the initial ring R m r , n r . Thus, the polyadic group ring R m r , n r = R m r , n r G n g (37) is multiplicatively totally associative for equal arities (50). □
Theorem 4.
In case of higher polyadic powers (42) ℓ n > 1 and/or ℓ g > 1 the total associativity of multiplication in the polyadic group ring R m r , n r = R m r , n r G n g follows from the associativity of the addition in the initial ring R m r , n r , if the strong inequalities take place
n r > n r ∪ n r > n g .
Proof. 
It follows from the “quantization” condition (47) and the informal consequence “larger brackets can be constructed from smaller brackets”. □
The polyadic distributivity in R m r , n r is governed by polyadic distributivity of the initial ring R m r , n r , because the addition is present only in the l.h.s. of the polyadic group ring elements (13).
By the same reason, if the initial ring R m r , n r has the polyadic zero z R , then the group ring R m r , n r has the polyadic zero z R of the form
z R = z R · Σ i g i , z R ∈ R , g i ∈ G , z R ∈ R ,
such that no group elements appear with nonzero coefficients, since the finite support, and such element is unique. Also, the zero z R in R m r , n r is the additive polyadic identity and is multiplicatively absorbing (for R m r , n r see (29) and (30))
ν R m r r α , z R , … , z R ︷ m r − 1 = r α ,
μ R n r r α 1 , r α 2 , … , r α n r − 1 , z R = z R , r α , r α i , z R ∈ R .
In the polyadic case, the identity of multiplication is only a neutral element (36) and has no connection with invertibility (see, e.g., [10]). If the initial m r , n r -ring R m r , n r has the polyadic identity e R (31) and the identity of the n g -ary group G n g (34) is e G , then the trivial polyadic identity e R of the group ring R m r , n r is
e R = e R · e G , e R ∈ R , e G ∈ G , e R ∈ R ,
such that in the sum (19) one coefficient from R m r , n r at the group identity e G is e R , while others are equal to z R and therefore are not written here.
The invertibility properties of polyadic structures are governed not by neutral elements, but by querelements [10]. So for elements from multiplicative n u -ary unit group U n u R m r , n r (the subset U R ⊂ R having the querelement r ¯ ), and the n g -ary group G n g (34) having the querelement g ¯ (35) for each g ∈ G , we can formulate
Definition 10.
In the group ring R m r , n r the querelement r ¯ α for some elements r α ∈ R is defined by
r ¯ α = Σ i r ¯ g i α · g ¯ i , r ¯ ∈ U , g ¯ i , g i ∈ G , r ¯ ∈ R ,
where in the simplest case r ¯ and g ¯ are defined in (33) and (35), respectively, if all arities coincide (50).
In the nontrivial approach, the r.h.s. can contain also more general elements for which one should solve system of equations in each concrete case. We denote the subset of multiplicatively invertible elements in the group ring R m r , n r (sometimes called group units) by U R ∈ R which should form the n u -ary group U n u R m r , n r , or a polyadic unit group.
Definition 11.
The polyadic augmentation map ε : R m r , n r G n g → R m r , n r can be defined for αth element (19) of R m r , n r as follows
Σ i max i = 1 r g i α · g i ↦ ν R m r ∘ ℓ i r g 1 α , … , r g ℓ i m r − 1 + 1 α , r g i α ∈ U R , g i ∈ G .
Remark 3.
Note that on the l.h.s. of (66) we have the formal sum Σ by i, if finite, then till i max , while on the r.h.s. the sum becomes m r -ary addition in the initial m r , n r -ring R m r , n r , therefore we have the “quantization” condition for the polyadic augmentation
i max = i max ℓ i , m r = ℓ i m r − 1 + 1 ,
where ℓ i is the polyadic power of the initial ring R m r , n r addition.
Definition 12.
The kernel of the polyadic augmentation map is called a polyadic augmentation ideal and is defined by setting coefficients sum in (66) equal to the polyadic zero (61), as follows
ker ε = R ∣ ν R m r ∘ ℓ i r g 1 α , … , r g ℓ i m r − 1 + 1 α = z R , r g i α ∈ U R , g i ∈ G .
The polyadic augmentation map ε preserves addition and multiplication without changing the arities and maps the corresponding identities in R m r , n r G n g and R m r , n r .

6. Examples

Let us present simple but nontrivial examples of the polyadic group rings R m r , n r = R m r , n r G n g and list their main properties. First, we present in detail the example of the polyadic power equal to one, then briefly show higher polyadic powers in addition and multiplication separately.
Example 1.
We take for the initial ring the commutative nonderived 2 , 3 -ring with the underlying set R = j Z ( j 2 = − 1 ), operations are in C . Now ν R 2 and μ R 3 are usual addition and product. Note that j Z ∣ ν R 2 is a binary group with respect to addition, and j Z ∣ μ R 3 is not a ternary group, but only a ternary semigroup, because there is no multiplicative querelement for each r ∈ R . Obviously, that R 2 , 3 is unitless. Note that polyadic distributivity follows from the binary distributivity in Z . Therefore,
R 2 , 3 = j Z ∣ ν R 2 , μ R 3 , z R
is a commutative nonderived 2 , 3 -ring without multiplicative neutral element and z R = j 0 = 0 .
Let C 3 = e , a , a 2 ∣ a 3 = a 0 = e be the cyclic group of order 3 with the identity e and one generator a. We take for the initial polyadic group G n g the finite set of 2 × 2 antidiagonal symbolic matrices G = a d i a g C 3 , C 3 , which is closed with respect to triple matrix multiplication. The element of G can be presented in the form
g i = g m , n = 0 a m a n 0 ,
where m , n ∈ Z mod 3 , such that the cardinality G = 9 , and the manifest form of the elements (70) are
g 1 = 0 e e 0 , g 2 = 0 a e 0 , g 3 = 0 a 2 e 0 , g 4 = 0 e a 0 0 a 2 e 0 , g 5 = 0 a a 0 , g 6 = 0 a 2 a 0 , g 7 = 0 e a 2 0 , g 8 = 0 a a 2 0 , g 9 = 0 a 2 a 2 0 .
The ternary multiplication μ G 3 is nonderived (any even product gives a diagonal matrix that is out of the set G = a d i a g ), ternary noncommutative and has the form
μ G 3 g i , g j , g k = g m 1 , n 1 g m 2 , n 2 g m 3 , n 3 = g m 1 + n 2 + m 3 , n 1 + m 2 + n 3 .
The ternary identity e G (36) is defined by
μ G 3 e G , e G , g = g .
Using (70) and (72) we obtain the identity in matrix form
e G = e t = 0 a t a 3 − t 0 , t = Z mod 3 .
So the ternary group G 3 has 3 identities
e G , 1 = e 0 = 0 e e 0 = g 1 , e G , 2 = e 1 = 0 a a 2 0 = g 9 , e G , 3 = e 2 = 0 a 2 a 0 = g 6 .
Each element in G 3 has its querelement g ¯ g or g ¯ m , n = g m , n ¯ defined by
μ G 3 g , g , g ¯ = g , g m , n g m , n g ¯ m , n = g m , n ,
and in the matrix form
g ¯ i = g ¯ m , n = 0 a 3 − n a 3 − m 0 , m , n = Z mod 3 .
Note that each element of G 3 is polyadic multiplicative idempotent (4) because from (72) it follows
g 3 = μ G 3 ∘ 3 g 7 = g , ∀ g ∈ G .
So during “polyadization” C 3 → a d i a g C 3 , C 3 the binary cyclic group of order 3 becomes the ternary group of idempotents of polyadic power 3.
Thus, we have that
G 3 = g i ∣ μ G 3 , e G , i , (   ) ¯ ,
where the queroperation (   ) ¯ is defined in (77), becomes the ternary group having 3 identities (75).
The polyadic group 2 , 3 -ring R 2 , 3 G 3 = R 2 , 3 , as the set R consists of the finite formal sums (13), and the αth element of R has the form
r α = Σ i r i α · g i , r i α ∈ R , g i ∈ G , r α ∈ R ,
where r i α ∈ j Z and g i are defined in (70). Manifestly, we obtain
r α = Σ i j k i α · 0 a m i a n i 0 , m i , n i = Z mod 3 , k i α ∈ Z .
There is no identity in the polyadic group ring R 2 , 3 G 3 , because 2 , 3 -ring R 2 , 3 is unitless, but zero is
z R = z R · g , z R = j 0 = 0 ∈ Z , g ∈ G 3 .
The commutative binary addition ν R 2 in R 2 , 3 is simply “left”-componentwise (42) and reduces to the binary addition ν R 2 in R 2 , 3 . The ternary multiplication μ R 3 in the polyadic group 2 , 3 -ring R 2 , 3 is noncommutative and needs gathering of the similar coefficients before each product of the ternary group G 3 (see (17) and (44)).
For instance, we have 3 elements of the polyadic group 2 , 3 -ring R 2 , 3
r 1 = 5 j · g 5 ,
r 2 = 2 j · g 7   ∔ − 7 j · g 8 ,
r 3 = − 4 j · g 2 ∔ 7 j · g 3 ∔ − 3 j · g 6 ,
where ∔ is the formal sum Σ i .
Now we ternary multiply them (46) and formally open the brackets (for brevity, clearness and conciseness we do not write the ternary multiplications manifestly)
r 0 = μ R 3 r 1 , r 2 , r 3 = 5 j · g 5 2 j · g 7 ∔ − 7 j · g 8 − 5 j · g 2 ∔ 7 j · g 3 ∔ − 3 j · g 6 = 5 j · g 5 2 j · g 7 − 4 j · g 2 ∔ 5 j · g 5 3 j · g 7 7 j · g 3 ∔ 5 j · g 5 2 j · g 7 − 3 j · g 6 ∔ 5 j · g 5 − 7 j · g 8 − 4 j · g 2 ∔ 5 j · g 5 − 7 j · g 8 7 j · g 3 ∔ 5 j · g 5 − 7 j · g 8 − 3 j · g 6 .
Then we use the ternary group multiplication (with manifest ternary multiplication μ R 3 in the initial ring R 2 , 3 and μ G 3 in the ternary multiplication in G 3 )
r 0 = μ R 3 5 j , 2 j , − 4 j · μ G 3 g 5 , g 7 , g 2 ∔ μ R 3 5 j , 2 j , 7 j · μ G 3 g 5 , g 7 , g 3 ∔ μ R 3 5 j , 2 j , − 3 j · μ G 3 g 5 , g 7 , g 6 ∔ μ R 3 5 j , − 7 j , − 4 j · μ G 3 g 5 , g 8 , g 2 ∔ μ R 3 5 j , − 7 j , 7 j · μ G 3 g 5 , g 8 , g 3 ∔ μ R 3 5 j , − 7 j , − 3 j · μ G 3 g 5 , g 8 , g 6 .
Performing the ternary multiplications μ R 3 and μ G 3 in R 5 , 3 we obtain the formal sum
r 0 = 40 j · g 5 ∔ − 70 j · g 6 ∔ 30 j · g 9 ∔ − 140 j · g 9 ∔ 245 j · g 9 ∔ − 105 j · g 3 .
Finally, we gather coefficients from the initial ring R 2 , 3 to get the ternary product of elements (83)–(85) from the polyadic group ring R 2 , 3 (81)
r 0 = − 105 j · g 3 ∔ 40 j · g 5 ∔ − 70 j · g 6 ∔ 135 j · g 9 .
The polyadic augmentation map ε (66) for the elements (83)–(85) and (89) becomes
ε r 1 = 5 j ,
ε r 2 = ε 2 j · g 7 ∔ − 7 j · g 8 = ν R 2 2 j , − 7 j = − 5 j ,
ε r 3 = ε − 4 j · g 2 ∔ 7 j · g 3 ∔ − 3 j · g 6 = ν R 2 ∘ 2 − 4 j , 7 j , − 3 j = 0 , ε r 0 = ε − 105 j · g 3 ∔ 40 j · g 5 ∔ − 70 j · g 6 ∔ 135 j · g 9
= ν R 2 ∘ 3 − 105 j , 40 j , − 70 j , 135 j = 0 ,
where on the r.h.s. there are binary additions in R 2 , 3 , while on the l.h.s. there are formal sums. According to (68) the elements r 3 and r 0 are in the kernel.
Let us modify the previous construction for higher polyadic power case.
Example 2.
Now we take for the initial ring the commutative nonderived 2 , 5 -ring with the underlying set R = j 4 Z ( j 4 4 = − 1 ), operations are in C . The operations ν R 2 and μ R 5 are usual addition and product being the binary addition and nonderived 5-ary multiplication (only product of 5 elements is closed). Thus j 4 Z ∣ ν R 2 is a binary group with respect to addition, and j 4 Z ∣ μ R 5 is not a 5-ary group, but only a 5-ary semigroup, because there is no multiplicative querelement for each r ∈ R (no division in Z ). Obviously, that R 2 , 5 is unitless. Note that polyadic distributivity follows from the binary distributivity in Z . Therefore,
R 2 , 5 = j 4 Z ∣ ν R 2 , μ R 5 , z R
is a commutative nonderived 2 , 5 -ring without multiplicative neutral element and z R = j 0 = 0 .
The ternary group G 3 is the same as in the previous example (79). The element of the polyadic group ring has the same form (80), but now the multiplication (46) is of 2nd polyadic power for G 3 , i.e., ℓ g = 2 ,
μ G 3 ∘ 2 g i 1 , g i 2 , g i 3 , g i 4 , g i 5 = g m 1 , n 1 g m 2 , n 2 g m 3 , n 3 g m 4 , n 4 g m 5 , n 5 = g m 1 + n 2 + m 3 + n 4 + m 5 , n 1 + m 2 + n 3 + m 4 + n 5 .
The initial ring R 2 , 5 is still of 1st multiplicative polyadic power
μ R 5 j 4 k 1 , j 4 k 2 , j 4 k 3 , j 4 k 4 , j 4 k 5 = j 4 k 1 j 4 k 2 j 4 k 3 j 4 k 4 j 4 k 5 = − j 4 k 1 k 2 k 3 k 4 k 5 , k i ∈ Z .
So manifestly the multiplicative arity of the polyadic group ring (48) using the “quantization” condition (47) with arities n r = 5 and n g = 3 , and different polyadic powers ℓ n = 1 and ℓ g = 2 becomes
n r = ℓ n n r − 1 + 1 = ℓ g n g − 1 + 1 = 1 ( 5 − 1 ) + 1 = 2 ( 3 − 1 ) + 1 = 5 .
The additive arity is inherited from the initial ring R 2 , 5 and is binary n r = n r = 2 . Thus, the polyadic group ring is actually a nonderived 2 , 5 -ring R 2 , 5 with 2nd polyadic power of the ternary group G 3 multiplication. The computations similar to the previous example can be done using the 5-ary multiplications (95) and (96), which manifestly shows the existence of higher power polyadic group rings.

7. Conclusions

This article has laid the foundational framework for the theory of polyadic group rings, a novel algebraic structure that generalizes the classical group ring construction R [ G ] to the higher arity setting. We have formally defined a novel algebraic object, the polyadic group ring R [ m r , n r ] = R [ m r , n r ] [ G [ n g ] ] , constructing its m r -ary addition and n r -ary multiplication by systematically generalizing the binary operations. A central achievement of this work is the derivation of the “quantization” conditions that govern the admissible arities, revealing the profound interplay between the arities of the initial ring, the initial polyadic group, and the resulting polyadic group ring, including the novel case of operations with higher polyadic powers.
We have established essential algebraic properties of these structures, proving conditions for total associativity and characterizing the existence of a zero element and identity. Furthermore, the generalization of key tools such as the augmentation map and augmentation ideal provides a bridge for transferring techniques from the classical theory into this new domain. The explicit, non-trivial examples involving nonderived rings and finite polyadic groups serve to concretely illustrate the theory and demonstrate the noncommutative, convoluted nature of the multiplication.
This work opens several avenues for future research. First, further investigation of recently introduced multiary graded polyadic algebras [14], which reveals fundamentally new phenomena not present in the binary case, such as the existence of higher-power gradings. This can be seen as a new direction in mathematical physics—one that uses polyadic algebraic structures—and, more concretely, as a novel approach to particle model building that employs graded algebras. The representation theory of polyadic group rings, their homology, and other homological invariants remain entirely unexplored and represent a natural next step. Furthermore, the recent emergence of applied polyadic structures, such as in the “polyadic encryption” scheme [18], strongly validates the practical potential of this foundational work [19].
Thus, the novel theory of polyadic group rings presented here not only enriches pure algebra but also provides a new mathematical language for the challenges of modern computation and security.

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. Bovdi, A.A. Group Rings; Uzhgorod University: Uzhgorod, Ukraine, 1974; p. 118. [Google Scholar]
  2. Passman, D.S. The Algebraic Structure of Group Rings; John Wiley and Sons: New York, NY, USA; London, UK; Sydney, Australia, 1977; p. xiv+720. [Google Scholar]
  3. Sehgal, S.K. Topics in Group Rings; Marcel Dekker: New York, NY, USA, 1978; p. vi+251. [Google Scholar]
  4. Giambruno, A.; Milies, C.P.; Sehgal, S.K. (Eds.) Groups, Rings and Group Rings. In Contemporary Mathematics; AMS: Providence, RI, USA, 2006; Volume 420. [Google Scholar]
  5. Jespers, E.; del Río, Á. Group Ring Groups, Vol. 1: Orders and Generic Constructions of Units; De Gruyter: Berlin, Germany, 2015. [Google Scholar]
  6. Jespers, E.; del Río, Á. Group Ring Groups, Vol. 2: Structure Theorems of Unit Groups; De Gruyter: Berlin, Germany, 2016. [Google Scholar]
  7. Dörnte, W. Unterschungen über einen verallgemeinerten Gruppenbegriff. Math. Z. 1929, 29, 1–19. [Google Scholar] [CrossRef] [Scilit]
  8. Post, E.L. Polyadic groups. Trans. Amer. Math. Soc. 1940, 48, 208–350. [Google Scholar] [CrossRef]
  9. Leeson, J.J.; Butson, A.T. On the general theory of (m, n) rings. Algebr. Univers. 1980, 11, 42–76. [Google Scholar] [CrossRef] [Scilit]
  10. Duplij, S. Polyadic Algebraic Structures; IOP Publishing: London/Bristol, UK, 2022; p. 461. [Google Scholar] [CrossRef] [Scilit]
  11. Głazek, K.; Michalski, J. Some remarks on n-group rings. Demonstr. Math. 1980, 13, 359–370. [Google Scholar]
  12. Zeković, B.; Artamonov, V.A. A connection between some properties of n-group rings and group rings. Math. Montisnigri 1999, 15, 151–158. [Google Scholar]
  13. Zeković, B.; Artamonov, V.A. On two problems for n-group rings. Math. Montisnigri 2002, 15, 79–85. [Google Scholar]
  14. Duplij, S. Multiary gradings. Axioms 2026, 15, 197. [Google Scholar] [CrossRef] [Scilit]
  15. Berlekamp, E.R. Algebraic Coding Theory; McGraw-Hill: New York, NY, USA, 1968. [Google Scholar]
  16. Richardson, T.; Urbanke, R.L. Modern Coding Theory; Cambridge University Press: Cambridge, UK, 2008. [Google Scholar]
  17. Menezes, A.J.; van Oorschot, P.C.; Vanstone, S.A. Handbook of Applied Cryptography; CRC Press: Boca Raton, FL, USA, 1997. [Google Scholar]
  18. Duplij, S.; Guo, Q. Polyadic encryption. Axioms 2025, 14, 835. [Google Scholar] [CrossRef] [Scilit]
  19. Duplij, S.; Fu, N.; Guo, Q. Cryptographic transformations over polyadic rings. arXiv 2025, arXiv:2512.12580. [Google Scholar] [CrossRef] [Scilit]
  20. Oppenheim, A.V. Applications of Digital Signal Processing; Prentice-Hall: Englewood Cliffs, NJ, USA, 1978. [Google Scholar]
  21. Zalesskii, A.E.; Mikhalev, A.V. Group rings. J. Sov. Math. 1975, 4, 1–78. [Google Scholar] [CrossRef] [Scilit]
  22. Milies, C.P.; Sehgal, S.K. An Introduction to Group Rings; Kluwer: Dordrecht, The Netherlands, 2002. [Google Scholar] [CrossRef] [Scilit]
  23. Curtis, C.W.; Reiner, I. Representation Theory of Finite Groups and Associative Algebras; AMS: Providence, RI, USA, 1962. [Google Scholar]
  24. Kirillov, A.A. Elements of the Theory of Representations; Springer: Berlin/Heidelberg, Germany, 1976. [Google Scholar]
  25. Erdmann, K.; Holm, T. Algebras and Representation Theory; Springer: Cham, Switzerland, 2018. [Google Scholar] [CrossRef] [Scilit]
  26. Duplij, S. Polyadic integer numbers and finite (m, n)-fields. P-Adic Numbers Ultrametric Anal. Appl. 2017, 9, 257–281. [Google Scholar] [CrossRef] [Scilit]
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.