Combinatorial aspects of \(n\)-ary polygroups and \(n\)-ary color schemes. (Q691578)

Polygroups are multivalued systems that satisfy group like axioms. The class of \(n\)-ary polygroups, as a subclass of \(n\)-ary hypergroups and as a generalization of polygroups was introduced by \textit{M. Ghadiri} and \textit{B. N. Waphare} [Iran. J. Sci. Technol., Trans. A, Sci. 33, No. 2, 145-158 (2009; Zbl 1216.20062)]. In this paper, some basic notions, examples and results on \(n\)-ary polygroups are given. In the sequel the generalizations of concepts of full conjugation relation, color scheme and chromaticity of polygroups [\textit{S. D. Comer}, Acta Univ. Carol., Math. Phys. 24, No. 2, 39-48 (1983; Zbl 0532.20042)] on \(n\)-ary polygroups are defined and discussed. Also some representation techniques for chromatic \(n\)-ary polygroups are presented. Thus, a construction of an \(n\)-ary polygroup from two other \(n\)-ary polygroups, which is a generalization of the corresponding Comer's construction, is presented. Finally, it is proved that the direct product of two \(n\)-ary color schemes and the class of \(n\)-ary groups by a full conjugation relation on \(n\)-ary polygroups is chromatic.