低增长方程复杂性
Low growth equational complexity
摘要:
代数$\mathscr{V}$的方程类的方程复杂度函数$β_\mathscr{V}:\mathbb{N}\to\mathbb{N}$限定了确定$\mathscr{V}$中$n$ -元代数的成员资格所需的方程的大小.具有无限方程复杂度的随机生成的变种$\mathscr{V}$的已知示例在$Ω(n^c)$中具有增长,通常对于$c\geq \frac{1}{2}$。我们表明,慢得多的增长是可能的,表现出$O(\log_2^3(n))$增长之间的品种半格序逆半群和加法幂等半环。我们还研究了方程复杂性的拟簇模拟,并证明了一个有限群具有多对数拟方程复杂性函数,有界当且仅当所有Sylow子群是阿贝尔群。
英文摘要:
The equational complexity function $β_\mathscr{V}:\mathbb{N}\to\mathbb{N}$ of an equational class of algebras $\mathscr{V}$ bounds the size of equation required to determine membership of $n$-element algebras in $\mathscr{V}$. Known examples of finitely generated varieties $\mathscr{V}$ with unbounded equational complexity have growth in $Ω(n^c)$, usually for $c\geq \frac{1}{2}$. We show that much slower growth is possible, exhibiting $O(\log_2^3(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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。