Search arXivSearch

arXiv · 1212.0885

Smoothing discrete Morse theory

Abstract

After surveying classical notions of PL topology of the Seventies, we clarify the relation between Morse theory and its discretization by Forman. We show that PL handles theory and discrete Morse theory are equivalent, in the sense that every discrete Morse vector on some PL triangulation is also a PL handle vector, and conversely, every PL handle vector is also a discrete Morse vector on some PL triangulation. It follows that in dimension up to 7, every discrete Morse vector on some PL triangulation is also a smooth Morse vector; the vice versa is true in all dimensions. This revises and improves a result by Gallais. Some further consequences of our work are: (1) For $d \ne 4$, every simply connected smooth d-manifold admits locally constructible triangulations. In contrast, the Mazur 4-manifold has no locally constructible triangulation. (This solves a question by Zivaljevic and completes work by the author and Ziegler.) (2) The Heegaard genus of 3-manifolds can be characterized as the smallest integer g for which some triangulation of the manifold has discrete Morse vector (1,g,g,1). (This allows for heuristics to bound the Heegaard genus of any 3-manifold.) (3) Some non-PL 5-spheres admit discrete Morse functions with only 2 critical faces. (This result, joint with Adiprasito, completes the Sphere Theorem by Forman.)

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bruno Benedetti. 2014-12-10. Smoothing discrete Morse theory. https://arxiv.org/abs/1212.0885

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT