Finite words with f_W(n) ≤ n are characterized, linking power avoidance and complexity, with applications to invariants of associative algebras.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.RA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Combinatorics on finite words and the length of a finite-dimensional associative algebra
Finite words with f_W(n) ≤ n are characterized, linking power avoidance and complexity, with applications to invariants of associative algebras.