Estimating Matveev's complexity via crystallization theory (Q868331): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1016/j.disc.2006.07.021 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2006.07.021 / rank
 
Normal rank

Latest revision as of 06:10, 10 December 2024

scientific article
Language Label Description Also known as
English
Estimating Matveev's complexity via crystallization theory
scientific article

    Statements

    Estimating Matveev's complexity via crystallization theory (English)
    0 references
    0 references
    2 March 2007
    0 references
    The definition of Matveev's complexity \(c(M^3)\) of a \(3\)--dimensional manifold \(M^3\) is based on the existence of a \textit{simple spine} for \(M^3\) [\textit{S. V. Matveev}, Acta Appl. Math. 19, No.~2, 101--130 (1990; Zbl 0724.57012)]. In the paper under discussion the author studies Matveev's complexity by making use of another combinatorial description of \(M^3\), the so called crystallization. This allows to improve the known estimates of \(c(M^3)\) for manifolds given as a \(2\)-fold or \(3\)-fold simple branched covering over links in \(S^3\) as well as for \(3\)-manifolds given by Dehn surgery on a framed link in \(S^3\).
    0 references
    Simple spine
    0 references
    Matveev's complexity
    0 references
    crystallization
    0 references
    branched coverings
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references