Immersed essential surfaces and Dehn surgery

It is known that an embedded essential surface F in a hyperbolic manifold M remains essential in Dehn filling spaces M(γ) for most slopes γ on a torus boundary component T of M. The main theorem of this paper is to generalize this result to immersed surfaces. More explicitly, if an immersed essential surface F has coannular slopes β₁,…,β_n on T, then there is a constant K such that F remains essential in M(γ) when Δ(γ,β_i)>K for all i. It will also be shown that all but finitely many Freedman tubings of a geometrically finite surface in M are π₁-injective.     

Algorithms for finding proper essential surfaces in 3-manifolds

In this paper, we present an algorithm which, for a given compact orientable irreducible boundary irreducible 3-manifold M, verifies whether M contains an essential orientable surface (possibly, with boundary), whose genus is at most N. The algorithm is based on Haken’s theory of normal surfaces, and on a trick suggested by Jaco and consisting in estimating the mean length of boundary curves in an unknown essential surface of a given genus in the given manifold.     

Positively oriented ideal triangulations on hyperbolic three-manifolds

Let M³ be a non-compact hyperbolic 3-manifold that has a triangulation by positively oriented ideal tetrahedra. We show that the gluing variety defined by the gluing consistency equations is a smooth complex manifold with dimension equal to the number of boundary components of M³. Moreover, we show that the complex lengths of any collection of non-trivial boundary curves, one from each boundary component, give a local holomorphic parameterization of the gluing variety. As an application, some estimates for the size of hyperbolic Dehn surgery space of once-punctured torus bundles are given.     

Irreducible Triangulations of Surfaces with Boundary

A triangulation of a surface is irreducible if no edge can be contracted to produce a triangulation of the same surface. In this paper, we investigate irreducible triangulations of surfaces with boundary. We prove that the number of vertices of an irreducible triangulation of a (possibly non-orientable) surface of genus g ≥ 0 with b ≥ 0 boundary components is O(g + b). So far, the result was known only for surfaces without boundary (b = 0). While our technique yields a worse constant in the O(.) notation, the present proof is elementary, and simpler than the previous ones in the case of surfaces without boundary.     

Reducing and annular Dehn fillings

If two Dehn fillings on a simple manifold create a reducible manifold and an annular manifold respectively, then the distance between those filling slopes is known to be at most two. Moreover, Eudave-Muñoz and Wu gave infinitely many examples of manifolds admitting reducing and annular Dehn fillings at distance two. In this paper, we complement their examples to establish a complete list of simple manifolds admitting such a pair of Dehn fillings.

     

5-Chromatic even triangulations on surfaces

A triangulation is said to be even if each vertex has even degree. It is known that every even triangulation on any orientable surface with sufficiently large representativity is 4-colorable [J. Hutchinson, B. Richter, P. Seymour, Colouring Eulerian triangulations, J. Combin. Theory, Ser. B 84 (2002) 225-239], but all graphs on any surface with large representativity are 5-colorable [C. Thomassen, Five-coloring maps on surfaces, J. Combin Theory Ser. B 59 (1993) 89-105]. In this paper, we shall characterize 5-chromatic even triangulations with large representativity, which appear only on nonorientable surfaces.     

Stacked polytopes and tight triangulations of manifolds

Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplex-wise linear embedding of the triangulation into Euclidean space is “as convex as possible”. It can thus be understood as a generalization of the concept of convexity. In even dimensions, super-neighborliness is known to be a purely combinatorial condition which implies the tightness of a triangulation. Here, we present other sufficient and purely combinatorial conditions which can be applied to the odd-dimensional case as well. One of the conditions is that all vertex links are stacked spheres, which implies that the triangulation is in Walkup?s class K(d). We show that in any dimension d?4, tight-neighborly triangulations as defined by Lutz, Sulanke and Swartz are tight. Furthermore, triangulations with k-stacked vertex links and the centrally symmetric case are discussed.     

Topological imitation of a colored link with the same Dehn surgery manifold

By the topological imitation theory, we construct, from a given colored link, a new colored link with the same Dehn surgery manifold. In particular, we construct a link with a distinguished coloring whose Dehn surgery manifold is a given closed connected oriented 3-manifold except the 3-sphere. As a result, we can naturally generalize the difference between the Gordon–Luecke theorem and the property P conjecture to a difference between a link version of the Gordon–Luecke theorem and the Poincaré conjecture. Similarly, we construct a link with a π₁-distinguished coloring whose Dehn surgery manifold is a given non-simply-connected closed connected oriented 3-manifold. We also construct a link with just two colorings whose Dehn surgery manifolds are the 3-sphere.     

Totally knotted Seifert surfaces with accidental peripherals

We show that if there exists an essential accidental surface in the knot exterior, then a closed accidental surface also exists. As its corollary, we know boundary slopes of accidental essential surfaces are integral or meridional. It is shown that an accidental incompressible Seifert surface in knot exteriors in is totally knotted. Examples of satellite knots with arbitrarily high genus Seifert surfaces with accidental peripherals are given, and a Haken 3-manifold which contains a hyperbolic knot with an accidental incompressible Seifert surface of genus one is also given.

     

Reducible and toroidal Dehn fillings with distance 3

If a simple 3-manifold M admits a reducible and a toroidal Dehn filling, the distance between the filling slopes is known to be bounded by three. In this paper, we classify all manifolds which admit a reducible Dehn filling and a toroidal Dehn filling with distance 3.     

Variétés de Waldhausen et fibrations sur le cercle

Let K be a finite union of Seifert fibres in a Waldhausen manifold. We study the fibrations over the circle of Mwhich equip M with cm open book structure with binding K. In general, these fibrations are transversal to the Waldhausen decomposition, and their monodromies are, up to isotopy, quasi-periodic diffeomorphisms of surfaces. We describe the relations between these monodromies and the topology of (M. K). In particuliar, we prove that there exists, up to conjugation, a finite number (possibly equal to zero) of such monodromies with all their Dehn twists being negative.     

Multiple-scale decomposition for the Zlamal approximation

For the Zlamal approximation (a piecewise-polynomial continuous approximation of degree at most two), it is proved that the space of approximating functions obtained by subdividing a triangulation contains the space corresponding to the given triangulation. Formulas for the multiple-scale decomposition (that is, the decomposition of old basis functions in the new ones) are explicitly written in the case of placing one additional vertex on one edge of the initial triangulation. The cases of placing a vertex on a boundary or an interior edge are considered. The obtained formulas can also be used when several vertices are added to sufficiently distant triangles, because the operation under consideration and its influence on the coefficients in the decomposition of the approximating function in the standard Zlamal basis are local. The local bases of the additional terms W in the decomposition of the new space of approximating functions into the direct sum of the old space and W are specified (in particular, in the cases of placing a new vertex on a boundary or an interior edge). For these bases, decomposition formulas and reconstructions of the wavelet transform are explicitly written. All of the formulas were tested by using the MuPAD 2.5.3 computer algebra system running under Linux.     

On combinatorial Gauss-Bonnet Theorem for general Euclidean simplicial complexes

For a finitely triangulated closed surface M ², let α_x be the sum of angles at a vertex x. By the well-known combinatorial version of the 2- dimensional Gauss-Bonnet Theorem, it holds Σ_x(2π - α_x) = 2πχ(M ²), where χ denotes the Euler characteristic of M ², α_x denotes the sum of angles at the vertex x, and the sum is over all vertices of the triangulation. We give here an elementary proof of a straightforward higher-dimensional generalization to Euclidean simplicial complexes K without assuming any combinatorial manifold condition. First, we recall some facts on simplicial complexes, the Euler characteristics and its local version at a vertex. Then we define δ(τ) as the normed dihedral angle defect around a simplex τ. Our main result is Σ_τ (-1)^dim(τ)δ(τ) = χ(K), where the sum is over all simplices τ of the triangulation. Then we give a definition of curvature κ(x) at a vertex and we prove the vertex-version Σ _x∈K0 κ(x) = χ(K) of this result. It also possible to prove Morse-type inequalities. Moreover, we can apply this result to combinatorial (n + 1)-manifolds W with boundary B, where we prove that the difference of Euler characteristics is given by the sum of curvatures over the interior of W plus a contribution from the normal curvature along the boundary B:

$$\chi \left( W \right) - \frac{1}{2}\chi \left( B \right) = \sum {_{\tau \in W - B}} {\left( { - 1} \right)^{\dim \left( \tau \right)}} + \sum {_{\tau \in B}} {\left( { - 1} \right)^{\dim \left( \tau \right)}}\rho \left( \tau \right)$$

.

     

Boundary slopes and the logarithmic limit set

The A-polynomial of a manifold whose boundary consists of a single torus is generalised to an eigenvalue variety of a manifold whose boundary consists of a finite number of tori, and the set of strongly detected boundary curves is determined by Bergman's logarithmic limit set, which describes the exponential behaviour of the eigenvalue variety at infinity. This enables one to read off the detected boundary curves of a multi-cusped manifold in a similar way to the 1-cusped case, where the slopes are encoded in the Newton polygon of the A-polynomial.     

Boundary slopes of non-orientable Seifert surfaces for knots

We study non-orientable Seifert surfaces for knots in the 3-sphere, and examine their boundary slopes. In particular, it is shown that for a crosscap number two knot, there are at most two slopes which can be the boundary slope of its minimal genus non-orientable Seifert surface, and an infinite family of knots with two such slopes will be described. Also, we discuss the existence of essential non-orientable Seifert surfaces for knots.     

Generating even triangulations on the torus

A triangulation on a surface $\mathbf{F}$ is a fixed embedding of a loopless graph on $\mathbf{F}$ with each face bounded by a cycle of length three. A triangulation is even if each vertex has even degree. We define two reductions for even triangulations on surfaces, called the 4-contraction and the twin-contraction. In this paper, we first determine the complete list of minimal 3-connected even triangulations on the torus with respect to these two reductions. Secondly, allowing a vertex of degree 2 and replacing the twin-contraction with another reduction, called the 2-contraction, we establish the list for all minimal even triangulations on the torus. We also describe several applications of the lists for solving problems on even triangulations.     

Dehn filling, reducible 3-manifolds, and Klein bottles

Let be a compact, connected, orientable, irreducible 3-manifold whose boundary is a torus. We announce that if two Dehn fillings create reducible manifold and manifold containing Klein bottle, then the maximal distance is three.

     

Minimal surfaces over stars

A JS surface is a minimal graph over a polygonal domain that becomes infinite in magnitude at the domain boundary. Jenkins and Serrin characterized the existence of these minimal graphs in terms of the signs of the boundary values and the side-lengths of the polygon. For a convex polygon, there can be essentially only one JS surface, but a non-convex domain may admit several distinct JS surfaces. We consider two families of JS surfaces corresponding to different boundary values, namely JS₀ and JS₁, over domains in the form of regular stars. We give parameterizations for these surfaces as lifts of harmonic maps, and observe that all previously constructed JS surfaces have been of type JS₀. We give an example of a JS₁ surface that is a new complete embedded minimal surface generalizing Scherk's doubly periodic surface, and show also that the JS₀ surface over a regular convex 2n-gon is the limit of JS₁ surfaces over non-convex stars. Finally we consider the construction of other JS surfaces over stars that belong neither to JS₀ nor to JS₁.     

Algorithms and numerical analysis of dc fields in a piecewise-homogeneous medium by the boundary integral equation method

Boundary integral equation methods are considered for computing dc fields in three-dimensional regions filled with a piecewise-homogeneous medium. The problem is formulated and a system of Fredholm boundary integral equations of first kind is constructed, following directly from Green’s formula. The numerical solution stages are considered in detail, including construction and triangulation of the numerical surfaces, evaluation of surface integrals, and solution of a system of block-matrix equations. Translated from Prikladnaya Matematika i Informatika, No. 30, pp. 35–45, 2008.     

Maillage simplicial d'un polyèdre arbitraire

Issues related to the existence of a triangulation of an arbitrary polyhedron are addressed. Given a boundary surface mesh (a set of triangular facets), the problem to decide whether or not a triangulation (with no internal points apart from the Steiner points) exists is reported to be NP-hard. In this paper, an algorithm to triangulate a general polyhedron is used which makes use of a classical Delaunay triangulation algorithm, a phase for recovering the missing boundary facets by means of facet partitioning and a final phase that makes it possible to remove the additional (non-Steiner) points previously defined so as to recover the initial boundary mesh thus resulting in a mesh of the given polyhedron. To cite this article: P.-L. George, H. Borouchaki, C. R. Acad. Sci. Paris, Ser. I 338 (2004).