Generating functions for ternary algebras and ternary trees (Q619473): Difference between revisions

The author continues her study of ternary algebras over an arbitrary field started in [Vestn. Samar. Gos. Univ., Estestvennonauchn. Ser. 2008, No. 2(61), 77-90 (2008; Zbl 1167.17304)]. She calculates explicitly the Hilbert-Poincaré series of the free ternary algebra of finite rank (which satisfies a cubic equation) and determines the growth of the coefficients of the series. Then she gives bases of free symmetric, antisymmetric, cyclic and bipartite ternary algebras in terms of planar rooted ternary trees of special types. Further, the author studies left nilpotent and completely left nilpotent algebras in the classes of all ternary algebras and of all symmetric, antisymmetric, cyclic and bipartite algebras. She shows that the computing of the (multilinear) codimension sequence in these left nilpotent algebras is equivalent to the enumeration of ternary trees which do not contain forbidden subtrees of a special kind. As the main result, the author proves that the complexity functions (i.e., the exponential generating functions of the codimension sequences) of the varieties of completely left nilpotent and left nilpotent ternary algebras are algebraic.