Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Zametki:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Matematicheskie Zametki, 2009, Volume 85, Issue 6, Pages 840–848
DOI: https://doi.org/10.4213/mzm3889 (Mi mzm3889) 		 
This article is cited in 2 scientific papers (total in 2 papers)

On Simplicial Partitions of Polytopes

A. A. Glazyrin

M. V. Lomonosov Moscow State University
Full-text PDF (413 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/mzm3889
Abstract: We prove some general properties of prismoids, i.e., polytopes all of whose vertices lie in two parallel planes. On the basis of these properties, we obtain a nontrivial lower bound for the number of simplices in a triangulation of the nn-dimensional cube.
Keywords: prismoid, (0,1)(0,1)-polytope, simplicial partition, triangulation, minimal triangulation, inextensible set.
Received: 15.06.2006
Revised: 23.10.2008
English version:
Mathematical Notes, 2009, Volume 85, Issue 6, Pages 799–806
DOI: https://doi.org/10.1134/S0001434609050228
Bibliographic databases:
UDC: 514.154
Language: Russian
Citation: A. A. Glazyrin, “On Simplicial Partitions of Polytopes”, Mat. Zametki, 85:6 (2009), 840–848; Math. Notes, 85:6 (2009), 799–806
Citation in format AMSBIB
\Bibitem{Gla09}
\by A.~A.~Glazyrin
\paper On Simplicial Partitions of Polytopes
\jour Mat. Zametki
\yr 2009
\vol 85
\issue 6
\pages 840--848
\mathnet{http://mi.mathnet.ru/mzm3889}
\crossref{https://doi.org/10.4213/mzm3889}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2572837}
\zmath{https://zbmath.org/?q=an:1181.52021}
\transl
\jour Math. Notes
\yr 2009
\vol 85
\issue 6
\pages 799--806
\crossref{https://doi.org/10.1134/S0001434609050228}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000267684500022}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-69949174322}
Linking options:
  • https://www.mathnet.ru/eng/mzm3889
  • https://doi.org/10.4213/mzm3889
  • https://www.mathnet.ru/eng/mzm/v85/i6/p840
    • This publication is cited in the following 2 articles:
    1. P. A. Pugach, V. A. Shlyk, “Piecewise linear approximation and polyhedral surfaces”, J. Math. Sci. (N. Y.), 200:5 (2014), 617–623  mathnet  crossref
    2. Glazyrin A., “Lower bounds for the simplexity of the nn-cube”, Discrete Math., 312:24 (2012), 3656–3662  crossref  mathscinet  zmath  isi  elib  scopus
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:471
    Full-text PDF :247
    References:56
    First page:13
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025