Combinatorics on Binary Words and Codimensions of Identities in Left Nilpotent Algebras


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

Numerical characteristics of polynomial identities of left nilpotent algebras are examined. Previously, we came up with a construction which, given an infinite binary word, allowed us to build a two-step left nilpotent algebra with specified properties of the codimension sequence. However, the class of the infinite words used was confined to periodic words and Sturm words. Here the previously proposed approach is generalized to a considerably more general case. It is proved that for any algebra constructed given a binary word with subexponential function of combinatorial complexity, there exists a PI-exponent. And its precise value is computed.

作者简介

M. Zaicev

Lomonosov Moscow State University

编辑信件的主要联系方式.
Email: zaicevmv@mail.ru
俄罗斯联邦, Leninskie Gory 1, Moscow, 119991

D. Repovš

Univerza v Ljubljani

Email: zaicevmv@mail.ru
斯洛文尼亚, Kongresni trg 12, Ljubljana, 1000

补充文件

附件文件
动作
1. JATS XML

版权所有 © Springer Science+Business Media, LLC, part of Springer Nature, 2019