Skip to main content
SpringerLink
Log in

Minimal Networks on the Regular n-Dimensional Simplex

  • Published:
Mathematical Notes Aims and scope Submit manuscript

Abstract

The paper gives the proof of the following fact: all simple, i.e., having no nodes of degree 2, trees that span the vertices of the regular n-dimensional simplex can be realized as nondegenerate minimal parametric networks.

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

REFERENCES

  1. G. A. Karpunin, “An analog of Morse theory for plane linear networks and the generalized Steiner problem,” Mat. Sb. [Russian Acad. Sci. Sb. Math.], 191 (2000), no. 2, 64-90.

    Google Scholar 

  2. G. A. Karpunin, “An analog of Morse theory for plane linear networks and the generalized Steinerproblem,” in: Addendum 2 to the book by A. O. Ivanov and A. A. Tuzhilin “Branching Geodesics.Geometric Theory of Local Minimal Networks”, The Edwin Mellen Press, Lewiston, 1999, pp. 388-407.

    Google Scholar 

  3. A. O. Ivanov and A. A. Tuzhilin, “Geometry of minimal networks and one-dimensional Plateau problem,” Uspekhi Mat. Nauk [Russian Math. Surveys], 47 (1992), no. 2, 53-115.

    Google Scholar 

  4. E. N. Gilbert and H. O. Pollak, “Steiner minimal trees,” SIAM J. Appl. Math., 16 (1968), 1-29.

    Google Scholar 

  5. W. D. Smith, “How to find Steiner minimal trees in Euclidean d-space,” Algorithmica, 7 (1992), 137-177.

    Google Scholar 

  6. A. O. Ivanov and A. A. Tuzhilin, “Geometry of the set of minimal networks of given topology with fixed boundary,” Izv. Ross. Akad. Nauk Ser. Mat. [Russian Acad. Sci. Izv. Math.], 61 (1997), no. 6, 119-152.

    Google Scholar 

  7. A. O. Ivanov, Geometric Properties of Locally Minimal Networks [in Russian], Doctorate thesis in the physico-mathematical sciences Moscow State Univ., Moscow, 1998.

  8. A. O. Ivanov and A. A. Tuzhilin, Minimal Networks. The Steiner Problem and Its Generalizations, CRC Press, Boca Raton, 1994.

    Google Scholar 

  9. H. W. E. Jung, “Ueber die kleinste Kugel, die eine räumliche Figur einschliesst,” J. Reine Angew. Math., 123(1901), 241-257.

    Google Scholar 

  10. H. G. Eggleston, Convexity, vol. 47, Cambridge Tracts in Math. and Math. Phys, Cambridge, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. M. V. Lomonosov Moscow State University, Russia

    G. A. Karpunin

Authors
  1. G. A. Karpunin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Karpunin, G.A. Minimal Networks on the Regular n-Dimensional Simplex. Mathematical Notes 69, 780–789 (2001). https://doi.org/10.1023/A:1010278314755

Download citation

  • Issue Date:

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

Search

Navigation