Non-finitely based monoids.
From MaRDI portal
Abstract: We present a general method for proving that a semigroup is non-finitely based. The method is strong enough to cover the non-finite basis arguments in articles [1,3,4,5,7,8, 11,14,16,21,27,31,36,37]. In particular, the method allows to generalize the results in [1,8,36,37] and to simplify their proofs. The method also allows to remove one of the requirements on the "special system of identities" used by P. Perkins in [16] to find the first two examples of finite non-finitely based semigroups. We use our method to prove eleven new sufficient conditions under which a monoid is non-finitely based. As an application, we find infinitely many new examples of finite finitely based aperiodic monoids whose direct product is non-finitely based.
The author provides eight conditions under which a monoid \(S\) admits no finite identity basis (Theorem 4.4). Each of these conditions involves two parameters -- a finite set of words \(W\) and an infinite sequence of identities \(\Sigma\) -- and is formulated as follows: if \(S\) satisfies all identities in \(\Sigma\) but each word in \(W\) is an isoterm for \(S\), then \(S\) is non-finitely based. The techniques used in the proof is also applied to simplify some known conditions under which a semigroup is non-finitely based, in particular, the ones found by \textit{P. Perkins} [J. Algebra 11, 298-314 (1969; Zbl 0186.03401)] and \textit{E. W. H. Lee} [Monatsh. Math. 168, No. 3-4, 461-472 (2012; Zbl 1292.20065)]; as yet another application the author provides a new proof for a result due to the reviewer [Int. J. Algebra Comput. 14, No. 5-6, 817-827 (2004; Zbl 1074.20036)].
Recommendations
Cites work
- A new example of a minimal nonfinitely based semigroup.
- A sufficient condition for the non-finite basis property of semigroups.
- Bases for equational theories of semi-groups
- Equations and dot-depth one
- Equations and monoid varieties of dot-depth one and two
- Existence of a new limit variety of aperiodic monoids
- Finite basis problem for semigroups of order five or less: generalization and revisitation.
- Finitely based finite involution semigroups with non-finitely based reducts
- Finitely based monoids obtained from non-finitely based semigroups.
- Finitely based sets of 2-limited block-2-simple words
- FINITELY BASED WORDS
- Finitely based, finite sets of words
- Finitely generated permutative varieties.
- Finiteness properties of varieties and the restriction to finite algebras.
- scientific article; zbMATH DE number 1668759 (Why is no real title available?)
- scientific article; zbMATH DE number 4138051 (Why is no real title available?)
- scientific article; zbMATH DE number 4023572 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 3561239 (Why is no real title available?)
- scientific article; zbMATH DE number 3335078 (Why is no real title available?)
- INHERENTLY NONFINITELY BASED FINITE SEMIGROUPS
- INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS
- Minimal non-finitely based semigroups.
- On certain finitely based varieties of semigroups
- On cross semigroup varieties and related questions
- On finite \(\mathcal J\)-trivial monoids
- On the axiomatic rank of varieties generated by a semigroup or monoid with one defining relation
- On the finite basis problem for certain 2-limited words.
- PROBLEMS OF BURNSIDE TYPE AND THE FINITE BASIS PROPERTY IN VARIETIES OF SEMIGROUPS
- REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT
- TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
- The finite basis problem for finite semigroups
- The finite basis problem for words with at most two non-linear variables.
- The finite basis property for varieties of semigroups
- The finite basis question for semigroups of order less than six
- Varieties generated by semigroups of order four
Cited in
(30)- Varieties generated by unstable involution semigroups with continuum many subvarieties
- The identities of the free product of a pair of two-element monoids
- Lee monoid \(L_4^1\) is non-finitely based
- Finitely based sets of 2-limited block-2-simple words
- Limit varieties of \(J\)-trivial monoids
- Equational theories of upper triangular tropical matrix semigroups
- On the ascending and descending chain conditions in the lattice of monoid varieties
- On a class of completely join prime \(J\)-trivial semigroups with unique involution
- On the finite basis problem for the monoids of partial extensive injective transformations.
- Finitely based, finite sets of words
- scientific article; zbMATH DE number 1668759 (Why is no real title available?)
- A sufficient condition under which a semigroup is nonfinitely based.
- scientific article; zbMATH DE number 6384800 (Why is no real title available?)
- The finite basis problem for words with at most two non-linear variables.
- Minimal non-finitely based monoids.
- The finite basis problem for the monoid of two-by-two upper triangular tropical matrices
- A Nonfinitely Based Semigroup of Triangular Matrices
- Chain varieties of monoids
- Monoid varieties with extreme properties
- Lee monoids are nonfinitely based while the sets of their isoterms are finitely based
- Classification of limit varieties of \(\mathcal{J}\)-trivial monoids
- Varieties of monoids with complex lattices of subvarieties
- Finitely based monoids obtained from non-finitely based semigroups.
- Catalan monoids inherently nonfinitely based relative to finite \(\mathscr{R}\)-trivial semigroups
- Varieties of monoids with a distributive subvariety lattice
- Strongly nonfinitely based monoids
- Cross varieties of aperiodic monoids with commuting idempotents
- Cross varieties of aperiodic monoids
- Finitely based monoids.
- The finite basis problem for Kiselman monoids.
This page was built for publication: Non-finitely based monoids.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744847)
