Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports]
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Sib. Èlektron. Mat. Izv.:
Year:
Volume:
Issue:
Page:
Find




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

Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2008, Volume 5, Pages 215–228 (Mi semr102)  
This article is cited in 2 scientific papers (total in 2 papers)

Research papers

Upper complexity bounds for an infinite family of graph-manifolds

E. A. Fominykhab

a Chelyabinsk State University
b Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences
Full-text PDF (323 kB) Citations (2)
References:
PDF
HTML
Abstract: We provide a new formula for an upper bound of complexity of closed connected graph-manifolds obtained by gluing together two Seifert manifolds fibered over the disc with two exceptional fibers and a Seifert manifolds fibered over the annulus with one exceptional fiber. This bound turns out to be sharp for all such manifolds up to complexity 12.
Keywords: Matveev's complexity, graph-manifolds.
Received February 7, 2008, published May 15, 2008
Bibliographic databases:
Document Type: Article
UDC: 515.16
MSC: 57M27
Language: Russian
Citation: E. A. Fominykh, “Upper complexity bounds for an infinite family of graph-manifolds”, Sib. Èlektron. Mat. Izv., 5 (2008), 215–228
Citation in format AMSBIB
\Bibitem{Fom08}
\by E.~A.~Fominykh
\paper Upper complexity bounds for an infinite family of graph-manifolds
\jour Sib. \`Elektron. Mat. Izv.
\yr 2008
\vol 5
\pages 215--228
\mathnet{http://mi.mathnet.ru/semr102}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2586633}
\elib{https://elibrary.ru/item.asp?id=11928975}
Linking options:
  • https://www.mathnet.ru/eng/semr102
  • https://www.mathnet.ru/eng/semr/v5/p215
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:218
    Full-text PDF :54
    References:41
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024