Skip to main content
Log in

The Universally Solvable Embedding Problem with Cyclic Kernel

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

Abstract

It is proved that the universally solvable embedding problem with cyclic kernel of odd order is semidirect. Bibliography: 4 titles.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. B. B. Lur'e, “Universally solvable embedding problems," Trudy MIAN, CLXXXIII (183), 121–126 (1990).

    Google Scholar 

  2. V. V. Ishkhanov, B. B. Lur'e, and D. K. Faddeev, The Embedding Problem in Galois Theory, Transl. Math. Monogr., 165, AMS (1997).

  3. J.-P. Serre, Cohomologie Négligeable, College de France, Paris (1993–94).

    Google Scholar 

  4. J.-P. Serre, Cohomologie Galoisienne, Springer-Verlag (1964).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ishkhanov, V.V., Lur'e, B.B. The Universally Solvable Embedding Problem with Cyclic Kernel. Journal of Mathematical Sciences 112, 4348–4352 (2002). https://doi.org/10.1023/A:1020394919710

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020394919710

Keywords

Navigation