Lower bounds for algebraic complexity of nilpotent associative algebras.

DOI10.1007/s10958-010-0065-0zbMath1221.16033OpenAlexW2000083017MaRDI QIDQ548764

A. V. Leont'ev

Publication date: 30 June 2011

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-010-0065-0

zbMATH Keywords

algorithmsnilpotent algebrasalgebraic complexitytensor rankscomplexities of algebrasproducts of elements

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Nil and nilpotent radicals, sets, ideals, associative rings (16N40) Computational aspects of associative rings (general theory) (16Z05)

Cites Work

• Unnamed Item
• On the algorithmic complexity of associative algebras
• On the multiplicative complexity of Lie algebras
• On the multiplicative complexity of simple the Lie algebras \(G_2\), \(F_4\), \(E_6\), \(E_7\), \(E_8\) and of semisimple Lie algebras

This page was built for publication: Lower bounds for algebraic complexity of nilpotent associative algebras.