Abstract

Let \(c_n \left( V \right)\) be the sequence of codimension growth for a variety V of associative algebras. We study the complexity function \(\mathcal{C}\left( {V,z} \right) = \sum\nolimits_{n = 0}^\infty {c_n } {{\left( V \right)z^n } \mathord{\left/ {\vphantom {{\left( V \right)z^n } {n!}}} \right. \kern-\nulldelimiterspace} {n!}}\), which is the exponential generating function for the sequence of codimensions. Earlier, the complexity functions were used to study varieties of Lie algebras. The objective of the note is to start the systematic investigation of complexity functions in the associative case. These functions turn out to be a useful tool to study the growth of varieties over a field of arbitrary characteristic. In the present note, the Schreier formula for the complexity functions of one-sided ideals of a free associative algebra is found. This formula is applied to the study of products of T-ideals. An exact formula is obtained for the complexity function of the variety Uc of associative algebras generated by the algebra of upper triangular matrices, and it is proved that the function \(c_n \left( {U_c } \right)\) is a quasi-polynomial. The complexity functions for proper identities are investigated. The results for the complexity functions are applied to study the asymptotics of codimension growth. Analogies between the complexity functions of varieties and the Hilbert--Poincare series of finitely generated algebras are traced.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.