Bicoset groups and symmetric graphs. (Q2577584)

This paper is a natural development of the work of \textit{V. M. Buchstaber, A. M. Vershik, S. A. Evdokimov}, and \textit{I. N. Ponomarenko} [see Funkts. Anal. Prilozh. 30, No. 3, 12-18 (1996; Zbl 0878.05082)], where the equivalence of discrete involutive multivalued groups and the category of combinatorial algebras is proved. The paper begins by fixing the definitions needed from the theory of multivalued groups and of symmetric graphs. The category of singly generated bicoset groups with Hermitian generators is discussed. A functor from the set of bicoset multivalued groups with one Hermitian generator to the set of symmetric graphs is constructed. This functor makes it possible to describe the set of bicoset multivalued groups with one Hermitian generator as a sum of categories, each of them being determined by a universal symmetric graph and a subgroup of automorphisms of this graph. Note. We consider that in order to make use of the short term of an \(n\)-group instead of an \(n\)-valued group is not appropriate. An \(n\)-group is a pair \((G,f)\), where \(f\colon G^n\to G\) is an associative \(n\)-ary operation such that for all \(a_1,\dots,a_n\in G\) the equations \(f(a_1,\dots,a_{i-1},x,a_{i+1},\dots,a_n)=a_i\), \(i=\overline{1,n}\) have an unique solution in \(G\) [see \textit{E. L. Post}, Trans. Am. Math. Soc. 48, 208-350 (1940; Zbl 0025.01201)].