Low growth equational complexity

From MaRDI portal
Publication:5228210




Abstract: The equational complexity function of an equational class of algebras mathscrV bounds the size of equation required to determine membership of n-element algebras in mathscrV. Known examples of finitely generated varieties mathscrV with unbounded equational complexity have growth in Omega(nc), usually for cgeqfrac12. We show that much slower growth is possible, exhibiting O(log23(n)) growth amongst 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.









This page was built for publication: Low growth equational complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5228210)