Skip to main content
SpringerLink
Log in

Realizability of combinatorial types of convex polyhedra over fields

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

Abstract

It is shown that the minimal subfield of the field of real numbers over which all real combinatorial types of convex polyhedra can be realized is the field of all real algebraic numbers.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Literature cited

  1. B. Grünbaum, Convex Polytopes, New York (1967).

  2. B. I. Argunov, “Configurational postulates and their algebraic equivalents,” Mat. Sb.,26, 425–456 (1950).

    Google Scholar 

  3. L. A. Skornyakov, “Projective planes,” Usp. Mat. Nauk,6, No. 6, 113–154 (1951).

    Google Scholar 

  4. E. Artin, Geometric Algebra [Russian translation], Moscow (1969).

Download references

Authors
  1. N. E. Mnev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 123, pp. 203–207, 1983.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mnev, N.E. Realizability of combinatorial types of convex polyhedra over fields. J Math Sci 28, 606–609 (1985). https://doi.org/10.1007/BF02104991

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02104991

Keywords

Search

Navigation