Skip to main content

Algorithmic Problems for Finite Groups and Finite Semigroups

  • Conference paper
Algorithmic Problems in Groups and Semigroups

Part of the book series: Trends in Mathematics ((TM))

  • 281 Accesses

Abstract

I survey certain recent results concerning with the decidability and the undecidability of certain natural problems arising in the theory of the classical Birkhoff operators (ℍ, \(\mathbb{S}\), ℙ, and their combinations) on classes of finite semigroups and groups.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Albert, R. Baldinger, and J. Rhodes, Undecidability of the identity problems for finite semigroups, J. Symbolic Logic, 57 (1992), 179–192.

    Article  MathSciNet  MATH  Google Scholar 

  2. C.J. Ash, Finite semigroups with commuting idempotents, J. Austral. Math. Soc. Ser. A, 43 (1987), 81–90.

    Article  MathSciNet  MATH  Google Scholar 

  3. E.A. Golubov and M.V. Sapir, Varieties of residually finite semigroups, Dokl. Akad. Nauk SSSR, 247-5 (1979), 1037–1041.

    MathSciNet  Google Scholar 

  4. T. Hall, S. Kublanovskii, S. Margolis, M. Sapir, and P.G. Trotter, Decidable and undecidable problems related to finite 0-simple semigroups, J. Pure Appl. Algebra, 119 (1997), 75–96.

    Article  MathSciNet  MATH  Google Scholar 

  5. S.I. Kublanovskii, Finite approximability of prevarieties of semigroups with respect to predicates, in Modern Algebra, Leningrad Gos. Ped. Inst., Leningrad, 1980, 58–88.

    Google Scholar 

  6. S. Kublanovsky and M. Sapir, Potential divisibility in finite semigroups is undecidable, Internat. J. Algebra Comput., to appear.

    Google Scholar 

  7. S. Kublanovsky and M. Sapir, A variety where the set of subalgebras of finite simple algebras is not recursive, Internat. J. Algebra Comput., to appear.

    Google Scholar 

  8. R. McKenzie, Residually small varieties of semigroups, Algebra Universalis, 13 (1981), 171–201.

    Article  MathSciNet  MATH  Google Scholar 

  9. D. Pigozzi, On some operations on classes of algebras, Algebra Universalis, 2 (1972), 346–353.

    Article  MathSciNet  MATH  Google Scholar 

  10. M.V. Sapir, The restricted Burnside problem for varieties of semigroups, Izv. Akad. Nauk SSSR Ser. Mat., 55-3 (1991), 670–679; Math. USSR-Izv., 38-3 (1992), 659–667 (English translation).

    Google Scholar 

  11. B.M. Schein, Embedding semigroups in generalized groups, Mat. Sb., 55 (1961), 379–400; Transi. Amer. Math. Soc., 139 (1988), 93–116 (English translation).

    Google Scholar 

  12. E.I. Zelmanov, The solution of the restricted Burnside problem for groups of odd exponent, Izv. Akad. Nauk SSSR Ser. Mat., 54-1 (1990), 42–59; Math. USSR-Izv, 36-1 (1991), 41–60 (English translation).

    Google Scholar 

  13. E.I. Zelmanov, A solution of the restricted Burnside problem for 2-groups, Mat. Sb., 182-4 (1991), 568–592; Math. USSR-Sb., 72-2 (1972), 543–565 (English translation).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer Science+Business Media New York

About this paper

Cite this paper

Kublanovskii, S.I. (2000). Algorithmic Problems for Finite Groups and Finite Semigroups. In: Birget, JC., Margolis, S., Meakin, J., Sapir, M. (eds) Algorithmic Problems in Groups and Semigroups. Trends in Mathematics. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-1388-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-1388-8_9

  • Publisher Name: Birkhäuser, Boston, MA

  • Print ISBN: 978-1-4612-7126-0

  • Online ISBN: 978-1-4612-1388-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics