Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the Complexity of Immersed Normal Surfaces
198
0
0.0
(
0
)
Added by
Arnaud de Mesmay
Publication date
2014
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Normal surface theory, a tool to represent surfaces in a triangulated 3-manifold combinatorially, is ubiquitous in computational 3-manifold theory. In this paper, we investigate a relaxed notion of normal surfaces where we remove the quadrilateral conditions. This yields normal surfaces that are no longer embedded. We prove that it is NP-hard to decide whether such a surface is immersed. Our proof uses a reduction from Boolean constraint satisfaction problems where every variable appears in at most two clauses, using a classification theorem of Feder. We also investigate variants, and provide a polynomial-time algorithm to test for a local version of this problem.
rate research
Read More
We prove the first polynomial bound on the number of monotonic homotopy moves required to tighten a collection of closed curves on any compact orientable surface, where the number of crossings in the curve is not allowed to increase at any time during the process. The best known upper bound before was exponential, which can be obtained by combining the algorithm of de Graaf and Schrijver [J. Comb. Theory Ser. B, 1997] together with an exponential upper bound on the number of possible surface maps. To obtain the new upper bound we apply tools from hyperbolic geometry, as well as operations in graph drawing algorithms---the cluster and pipe expansions---to the study of curves on surfaces. As corollaries, we present two efficient algorithms for curves and graphs on surfaces. First, we provide a polynomial-time algorithm to convert any given multicurve on a surface into minimal position. Such an algorithm only existed for single closed curves, and it is known that previous techniques do not generalize to the multicurve case. Second, we provide a polynomial-time algorithm to reduce any $k$-terminal plane graph (and more generally, surface graph) using degree-1 reductions, series-parallel reductions, and $Delta Y$-transformations for arbitrary integer $k$. Previous algorithms only existed in the planar setting when $k le 4$, and all of them rely on extensive case-by-case analysis based on different values of $k$. Our algorithm makes use of the connection between electrical transformations and homotopy moves, and thus solves the problem in a unified fashion.
Given a triangulation of a closed, oriented, irreducible, atoroidal 3-manifold every oriented, incompressible surface may be isotoped into normal position relative to the triangulation. Such a normal oriented surface is then encoded by non-negative integer weights, 14 for each 3-simplex, that describe how many copies of each oriented normal disc type there are. The Euler characteristic and homology class are both linear functions of the weights. There is a convex polytope in the space of weights, defined by linear equations given by the combinatorics of the triangulation, whose image under the homology map is the unit ball, B, of the Thurston norm. Applications of this approach include (1) an algorithm to compute B and hence the Thurston norm of any homology class, (2) an explicit exponential bound on the number of vertices of B in terms of the number of simplices in the triangulation, (3) an algorithm to determine the fibred faces of B and hence an algorithm to decide whether a 3-manifold fibres over the circle.
The paper contains a new proof that a complete, non-compact hyperbolic $3$-manifold $M$ with finite volume contains an immersed, closed, quasi-Fuchsian surface.
We investigate the complexity of finding an embedded non-orientable surface of Euler genus $g$ in a triangulated $3$-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance of embeddability of complexes into $3$-manifolds. We prove that the problem is NP-hard, thus adding to the relatively few hardness results that are currently known in 3-manifold topology. In addition, we show that the problem lies in NP when the Euler genus g is odd, and we give an explicit algorithm in this case.
In this paper we study the common distance between points and the behavior of a constant length step discrete random walk on finite area hyperbolic surfaces. We show that if the second smallest eigenvalue of the Laplacian is at least 1/4, then the distances on the surface are highly concentrated around the minimal possible value, and that the discrete random walk exhibits cutoff. This extends the results of Lubetzky and Peres ([20]) from the setting of Ramanujan graphs to the setting of hyperbolic surfaces. By utilizing density theorems of exceptional eigenvalues from [27], we are able to show that the results apply to congruence subgroups of $SL_{2}left(mathbb{Z}right)$ and other arithmetic lattices, without relying on the well known conjecture of Selberg ([28]). Conceptually, we show the close relation between the cutoff phenomenon and temperedness of representations of algebraic groups over local fields, partly answering a question of Diaconis ([7]), who asked under what general phenomena cutoff exists.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
