Complexity , Heegaard diagrams and generalized Dunwoody manifolds ∗

@inproceedings{Vesnin2008ComplexityH,
  title={Complexity , Heegaard diagrams and generalized Dunwoody manifolds ∗},
  author={Alessia Cattabriga Michele Mulazzani Andrei Vesnin},
  year={2008}
}
  • Alessia Cattabriga Michele Mulazzani Andrei Vesnin
  • Published 2008
We deal with Matveev complexity of compact orientable 3manifolds represented via Heegaard diagrams. This lead us to the definition of modified Heegaard complexity of Heegaard diagrams and of manifolds. We define a class of manifolds which are generalizations of Dunwoody manifolds, including cyclic branched coverings of two-bridge knots and links, torus knots, some pretzel knots, and some theta-graphs. Using modified Heegaard complexity, we obtain upper bounds for their Matveev complexity, which… CONTINUE READING
0 Citations
26 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Computing Matveev’s complexity via cristallization theory: the orientable case

  • M. R. Casali, P. Cristofori
  • Acta Appl. Math., 92
  • 2006
1 Excerpt

Representations of ( 1 , 1 )knots

  • M. Mulazzani
  • Fund . Math .
  • 2004

Torus knots and Dunwoody manifolds

  • H. Aydin, I. Gultekin, M. Mulazzani
  • Siberian Math. J. 45
  • 2004
1 Excerpt

Circulant recursive matrices, Algebraic combinatorics and computer science. A tribute to Gian-Carlo Rota, 111–127

  • M. Barnabei, L. B. Montefusco
  • 2001
1 Excerpt

Estimating Matveev complexity via cristallization theory

  • L. B. Montefusco
  • Discr . Math .
  • 2001

Similar Papers

Loading similar papers…