Multiary gradings

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.

💡 Research Summary

The paper “Multiary Gradings” develops a systematic theory of graded polyadic (multi‑place) algebras, extending the classical notion of group‑graded algebras to settings where both the algebraic operations and the grading group operations have arbitrary arities. After a brief historical overview of binary graded algebras and their applications, the authors introduce the necessary polyadic terminology: an n‑ary multiplication µₙ, an m‑ary addition νₘ, the concept of polyadic power (ℓ‑power), and the notion of a “querelement” for polyadic groups.

The central definition (Definition 3.3) describes a G‑graded polyadic k‑algebra Aₘ,ₙ as a direct sum
 Aₘ,ₙ = ⊕{g∈Gₙ₁} A_g,
where Gₙ₁ is an n₁‑ary group. Compatibility between the algebra’s n‑ary multiplication and the grading group’s n₁‑ary multiplication is expressed by
 µₙ(A{g₁},…,A_{gₙ}) ⊆ A_{µₙ₁(g₁,…,gₙ₁)}.
If equality holds, the grading is called strong. The paper proves several fundamental structural results for such gradings.

First, Proposition 3.6 shows that in a strongly graded algebra the arities must coincide (n₁ = n). However, the authors later construct “higher‑power gradings” where n₁ ≠ n, demonstrating that the equality is not a universal necessity.

A key quantitative relationship is given in Theorem 3.9: for a strongly G‑graded polyadic algebra the order of the finite grading group satisfies
 |G| = ℓₘ·(m − 1) + 1,
where ℓₘ is the number of repetitions of the m‑ary addition needed to form a word of admissible length. This “quantization rule” links the size of the grading group directly to the arity of addition, a phenomenon absent from binary grading theory.

Section 4 defines polyadic graded homomorphisms as pairs (Φ, Ψ) where Φ respects the m‑ary addition and n‑ary multiplication, and Ψ respects the n₁‑ary group operation. Using these maps, the authors prove a First Isomorphism Theorem for graded polyadic algebras (Section 5.1): the kernel of Φ is a graded ideal, the image is a graded subalgebra, and A/ker Φ ≅ im Φ as graded structures. This generalizes the classical isomorphism theorem to the multiary context.

The paper then presents concrete families of examples. In Section 6, ternary superalgebras are constructed with a binary Z₂‑grading (derived case) and with a ternary grading group (non‑derived case). Section 7 studies polynomial algebras over n‑ary matrices graded by the polyadic integer group Z_{r²,s²}, illustrating how polynomial degree and matrix size interact under polyadic multiplication. Section 8 introduces “higher‑power multiary gradings” where the arities n₁ and n differ; the authors derive a generalized quantization condition ℓ·n₁ p n₁ − 1 q = ℓ·p n − 1 q, showing that the support of the grading can be the whole group even when the arities are mismatched.

Throughout, the authors emphasize that moving from binary to polyadic gradings yields genuinely new phenomena: non‑trivial constraints on arities, the possibility of grading groups without identities, and the emergence of “power gradings” where repeated polyadic operations replace ordinary scalar multiplication. The work suggests potential applications in physics (multi‑particle interactions), computer science (data structures with multi‑place operations), and higher‑dimensional algebra. The manuscript concludes with a discussion of open problems and a bibliography of 36 recent references.