Higher power polyadic group rings
By: Steven Duplij
Potential Business Impact:
Creates new math for secret codes and fixing errors.
This paper introduces and systematically develops the theory of polyadic group rings, a higher arity generalization of classical group rings $\mathcal{R}[\mathsf{G}]$. We construct the fundamental operations of these structures, defining the $\mathbf{m}_{r}$-ary addition and $\mathbf{n}_{r} $-ary multiplication for a polyadic group ring $\mathrm{R}^{[\mathbf{m} _{r},\mathbf{n}_{r}]}=\mathcal{R}^{[m_{r},n_{r}]}[\mathsf{G}^{[n_{g}]}]$ built from a nonderived $(m_{r},n_{r})$-ring and a nonderived $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. This work establishes a new foundation in ring theory with potential applications in cryptography and coding theory, as evidenced by recent schemes utilizing polyadic structures.
Similar Papers
Higher power polyadic group rings
Rings and Algebras
Creates new math for secret codes and error fixing.
Computational and Categorical Frameworks of Finite Ternary $Γ$-Semirings: Foundations, Algorithms, and Industrial Modeling Applications
Rings and Algebras
Organizes math rules for computers to use.
Duality on group algebras over finite chain rings: applications to additive group codes
Information Theory
Makes computer codes more efficient for sending data.