Every decidable pseudovariety of abelian groups is completely tame

DOI10.1007/S00233-019-10024-1MaRDI QIDQ2003184zbMATH OpenOpenAlexWikidataFDO

Authors Khadijeh Alibabaei

Publication date 16 July 2019

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.09131

zbMATH Keywords

\(\sigma \)-full pseudovarietycompletely reducible pseudovarietycompletely tame pseudovarietyimplicit signaturepseudovariety of semigroupsrational constraintrelatively free profinite semigroupsystem of equationsweakly reducible pseudovariety

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Varieties and pseudovarieties of semigroups (20M07) Semigroups in automata theory, linguistics, etc. (20M35)

Abstract: It has been shown that the proper, non-locally finite pseudovarieties of abelian groups are not tame with respect to the canonical signature. In this paper, we show that every decidable, proper, non-locally finite pseudovariety of abelian groups is completely tame with respect to a further enlarged implicit signature. This theorem yields as a corollary that a pseudovariety of abelian groups is decidable if and only if it is completely tame.

Review text

Let \(\mathbf V\) be a pseudovariety of finite semigroups. \(\mathbf V\) is said to be decidable if there is an algorithm to test for every finite semigroup \(S\) the membership \(S\in\mathbf V\). Since the decidability is not preserved by some operations such as semidirect product, join and Mal'cev product of pseudovarieties, a notion of tameness has been introduced by \textit{J. Almeida} and \textit{B. Steinberg} as a ``refined version of decidability [Proc. Lond. Math. Soc. (3) 80, No. 1, 50--74 (2000; Zbl 1027.20033)]. Using tameness of pseudovarieties it is possible to establish the decidability of pseudovarieties obtained by application of the mentioned operations. It is shown that ``every decidable, proper, non-locally finite pseudovariety of abelian groups is completely tame with respect to a further enlarged implicit signature. It is worth mentioning the following corollary. ``Every pseudovariety of finite abelian groups is decidable if and only if it is completely tame.

Recommendations

• TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS
• Tameness of joins involving the pseudovariety of local semilattices.
• Tameness of pseudovariety joins involving R.
• TAMENESS OF THE PSEUDOVARIETY LS1
• Tameness of Some Locally Trivial Pseudovarieties

Cites work

• Abelian pointlikes of a monoid
• Complete reducibility of systems of equations with respect to \(\mathbf R\).
• Dynamics of implicit operations and tameness of pseudovarieties of groups
• Equations in free groups are not finitely approximable
• Extending partial automorphisms and the profinite topology on free groups
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 798167 (Why is no real title available?)
• scientific article; zbMATH DE number 1416098 (Why is no real title available?)
• INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• Integer matrix diagonalization
• Monoid kernels and profinite topologies on the free Abelian group
• ON SEPARABILITY PROPERTIES OF GROUPS
• On some systems of equations with constraints in a free group. -- Addenda.
• On the Decidability of Iterated Semidirect Products with Applications to Complexity
• On the profinite topology on negatively curved groups
• PSEUDOVARIETY JOINS INVOLVING ${\mathscr J}$ -TRIVIAL SEMIGROUPS
• Semidirect product with an order-computable pseudovariety and tameness.
• Solving systems of equations modulo pseudovarieties of Abelian groups and hyperdecidability.
• Tameness of pseudovariety joins involving R.
• TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS
• Undecidability of the identity problem for finite semigroups
• UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS

Cited in

(7)

• Profinite topologies
• Dynamics of implicit operations and tameness of pseudovarieties of groups
• TAMENESS OF THE PSEUDOVARIETY LS1
• The pseudovariety of all nilpotent groups is tame
• Solving systems of equations modulo pseudovarieties of Abelian groups and hyperdecidability.
• TAMENESS OF THE PSEUDOVARIETY OF ABELIAN GROUPS
• On algorithmic problems for joins of pseudovarieties

This page was built for publication: Every decidable pseudovariety of abelian groups is completely tame

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