Computational and Categorical Frameworks of Finite Ternary $\Gamma$-Semirings: Foundations, Algorithms, and Industrial Modeling Applications

TL;DR

This paper develops a computational and categorical framework for classifying finite ternary $\Gamma$-semirings, providing algorithms and algebraic insights to facilitate their analysis and application in industry.

Contribution

It introduces explicit classification algorithms and categorical models for finite ternary $\Gamma$-semirings, extending their structural theory with computational tools.

Findings

Classified all systems of order |T| ≤ 4.

Verified polynomial-time complexity of algorithms.

Connected ternary $\Gamma$-semirings with categorical models.

Abstract

Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration algorithms are developed to generate all non-isomorphic finite ternary $\Gamma$-semirings satisfying closure, distributivity, and symmetry. Automorphism analysis, canonical labeling, and pruning strategies ensure uniqueness and tractability, while categorical constructs formalize algebraic relationships. \\ \textit{Results:} The implementation classifies all systems of order $|T|\!\le\!4$ and verifies symmetry-based subvarieties. Complexity analysis confirms polynomial-time performance, and categorical interpretation connects ternary $\Gamma$-semirings with functorial models in universal algebra. \\ Conclusion: The work establishes a verified computational theory and categorical synthesis for finite ternary $\Gamma$-semirings, integrating algebraic structure, algorithmic enumeration, and symbolic computation to support future industrial and decision-model applications.