Документ взят из кэша поисковой машины. Адрес оригинального документа : http://www.mccme.ru/tg2007/talks/Vesnin.pdf Дата изменения: Tue Nov 27 18:20:56 2007 Дата индексирования: Tue Oct 2 09:23:32 2012 Кодировка: Поисковые слова: http www.astronomy.ru forum index.php topic 4644.0.html

A. Yu. Vesnin Sobolev Institute of Mathematics Novosibirsk, Russia vesnin@math.nsc.ru

Volumes and complexity of hyp erb olic three-dimensional manifolds
If M is a compact 3-dimensional manifold, its complexity [1] is a non-negative integer c(M ) which formally translates the intuitive notion of "how complicated" M is. In particular, if M is closed and irreducible and different from the 3-sphere S3 , the pro jective 3-space RP3 , and the lens space L(3, 1), its complexity c(M ) is equal to the minimum of the number of tetrahedra over all triangulations of M . The complexity function has many natural properties, among which additivity under connected sum. The task of computing the complexity c(M ) of a given manifold M is extremely difficult. For closed M , the exact value is presently known only if M belongs to the computer-generated tables of manifolds up to complexity 12, see [2]. We will present recent results obtained jointly with Sergei Matveev and Carlo Petronio on two-sided bounds for complexity for some infinite families of closed orientable hyperbolic 3manifolds. In all cases the upper bounds are based on triangulating of fundamental polyhedra and the low bounds are based on computations or estimations of hyperbolic volumes. The first family consists of LЁ ell manifolds L(n) which generalize the first example of a ob closed orientable hyperbolic 3-manifold constructed by F. LЁ ell [3] in 1931. ob ob Theorem 1 ([4],[5]). If L(n) denotes the n-th set of LЁ el l manifolds, then for any M L(n) the complexity of M satisfies the lower and upper estimates 10n c(M ) 47n - 92, 5.

the former one being valid for sufficiently large n and the latter one for al l n

Here the crucial point for the lower estimate is the Vinberg formula for volume of a double-rectangular tetrahedron [6]. The second family of manifolds consists of cyclic branched coverings of the 3-sphere branched along two-bridge links. For a two-bridge link K (p, q ) let us denote by (p, q ) the minimum of lengths of continuous fractions representing the rational number p/q . Theorem 2 ([7]). Let K (p, q ) be a given two-bridge knot (or link) and let (Mn (p, q )) be n=2 a sequence of meridian-cyclic n-fold branched coverings of S 3 , branched along K (p, q ). Then: c(Mn (p, q )) n(p - 1) n. 7 with c = 4:

If in addition K (p, q ) is hyperbolic then the fol lowing inequality holds for n c(Mn (p, q )) > n · 1 - c 2 n2
3 /2

· max{2, 2 (p, q ) - 2.6667 . . . }; 6 with

moreover, if K (p, q ) is neither K (5, 2) nor K (7, 3), then the inequality holds for n c = 2 2.

We will also discuss some particular cases of 2-bridge knots for which the estimates can be improved. For example, for the Fibonacci manifold M (n) constructed in [8], which is the n-fold cyclic branched covering of S 3 branched along the figure-eight knot, we get Theorem 3 ([5]). If M (n) denotes the n-th Fibonacci manifold, then its complexity satisfies the lower and upper estimates 2n c(M (n)) 3n, the former one being valid for sufficiently large n and the latter one for al l n 1 4.


References [1] S. V. Matveev, Algorithmic topology and classification of 3-manifolds, ACM-monographs Vol. 9, Springer-Verlag, Berlin-Heidelberg-New York, 2003. [2] S. V. Matveev, Recognition and tabulation of 3-manifolds, Dokl. Akad. Nauk 71 (2005), 20-22. Ё [3] F. Lobell, Beispiele geschlossene dreidimensionaler Clifford -- Kleinischer RЁ aume negative Krummung, Ber. Verh. SЁ hs. Akad. Lpz., Math.-Phys. Kl. 83 (1931), 168Ё ac 174. ob [4] S. Matveev, C. Petronio, A. Vesnin, Two-sided complexity bounds for LЁ el l manifolds, Dokl. Akad. Nauk 76 (2007), 689-691. [5] S. Matveev, C. Petronio, A. Vesnin, Two-sided asymptotic bounds for the complexity of some closed hyperbolic three-manifolds, Preprint math.GT/0602372. [6] E. Vinberg, Volumes of non-Euclidean polyhedra, Russian Math. Surveys 48(2) (1993), 15­ 45. [7] C. Petronio, A. Vesnin, Two-sided asymptotic bounds for the complexity of cyclic branched coverings of two-bridge links, Preprint math.GT/0612830. [8] H. Helling, A. C. Kim, J. L. Mennicke, A geometric study of Fibonacci groups, J. Lie Theory 8 (1999), 1-23.

2