Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T18:13:27.998Z Has data issue: false hasContentIssue false

Low Growth Equational Complexity

Published online by Cambridge University Press:  25 September 2018

Marcel Jackson*
Affiliation:
Department of Mathematics and Statistics, La Trobe University, Victoria 3086, Australia (m.g.jackson@latrobe.edu.au)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The equational complexity function $\beta \nu \,:\,{\open N} \to {\open N}$ of an equational class of algebras bounds the size of equation required to determine the membership of n-element algebras in . Known examples of finitely generated varieties with unbounded equational complexity have growth in Ω(nc), usually for c ≥ (1/2). We show that much slower growth is possible, exhibiting $O(\log_{2}^{3}(n))$ growth among varieties of semilattice-ordered inverse semigroups and additive idempotent semirings. We also examine a quasivariety analogue of equational complexity, and show that a finite group has polylogarithmic quasi-equational complexity function, bounded if and only if all Sylow subgroups are abelian.

Information

Type
Research Article
Copyright
Copyright © Edinburgh Mathematical Society 2018