Skip to main content

Quotient Structures and Groups Computable in Polynomial Time

  • Conference paper
  • First Online:
Computer Science – Theory and Applications (CSR 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13296))

Included in the following conference series:

  • 334 Accesses

Abstract

We prove that every quotient structure of the form \({\mathscr {A}}/E\), where \({\mathscr {A}}\) is a structure computable in polynomial time (\(\text {P}\)-computable), and E is a \(\text {P}\)-computable congruence in \({\mathscr {A}}\), is isomorphic to a \(\text {P}\)-computable structure. We also prove that for every \(\text {P}\)-computable group \({\mathscr {A}} = (A,\cdot ) \), there is a \(\text {P}\)-computable group \( {\mathscr {B}}\cong {\mathscr {A}} \), in which the inversion operation \(x^{-1}\) is also \(\text {P}\)-computable.

The author is grateful to S. S. Goncharov, N. A. Bazhenov, V. L. Selivanov, S. S. Ospichev, and A. V. Seliverstov for fruitful discussions that allowed to improve the quality of the article.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Cenzer, D., Remmel, J.: Polynomial time versus recursive models. Ann. Pure Appl. Logic 54(1), 17–58 (1991)

    Article  MathSciNet  Google Scholar 

  2. Cenzer, D., Remmel, J.: Polynomial-time abelian groups. Ann. Pure Appl. Logic 56(1–3), 313–363 (1992)

    Article  MathSciNet  Google Scholar 

  3. Alaev, P.E.: Structures computable in polynomial time. I. Algebra Logic 55(6), 421–435 (2016)

    Article  MathSciNet  Google Scholar 

  4. Alaev, P.E.: Polynomially computable structures with finitely many generators. Algebra Logic 59(3), 266–272 (2020)

    Article  MathSciNet  Google Scholar 

  5. Alaev, P.E.: Finitely generated structures computable in polynomial time. Siberian Math. J. (submitted)

    Google Scholar 

  6. Alaev, P.E., Selivanov, V.L.: Fields of algebraic numbers computable in polynomial time. I. Algebra Logic 58(6), 447–469 (2019)

    Article  MathSciNet  Google Scholar 

  7. Cenzer, D., Remmel, J. B.: Complexity theoretic model theory and algebra. In: Handbook of Recursive Mathematics, vol. 1, pp. 381–513. Elsevier (1998)

    Google Scholar 

  8. Alaev, P.E., Selivanov, V.L.: Fields of algebraic numbers computable in polynomial time. II. Algebra Logic 60(6) (2021)

    Google Scholar 

  9. Alaev, P.E., Selivanov, V.L.: Searching for applicable versions of computable structures. In: De Mol, L., Weiermann, A., Manea, F., Fernández-Duque, D. (eds.) CiE 2021. LNCS, vol. 12813, pp. 1–11. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-80049-9_1

    Chapter  Google Scholar 

  10. Kalimullin, I., Melnikov, A., Ng, K.M.: Algebraic structures computable without delay. Theoret. Comput. Sci. 674, 73–98 (2017)

    Article  MathSciNet  Google Scholar 

  11. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)

    MATH  Google Scholar 

  12. Bazhenov, N., Harrison-Trainor, M., Kalimullin, I., Melnikov, A., Ng, K.M.: Automatic and polynomial-time algebraic structures. J. Symb. Logic 84(4), 1630–1669 (2019)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgement

The study was carried out within the framework of the state contract of the Sobolev Institute of Mathematics (project no FWNF-2022-0011), and partially supported by RFBR according to the research project no. 20-01-00300.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pavel Alaev .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Alaev, P. (2022). Quotient Structures and Groups Computable in Polynomial Time. In: Kulikov, A.S., Raskhodnikova, S. (eds) Computer Science – Theory and Applications. CSR 2022. Lecture Notes in Computer Science, vol 13296. Springer, Cham. https://doi.org/10.1007/978-3-031-09574-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-09574-0_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-09573-3

  • Online ISBN: 978-3-031-09574-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics