Related papers: An algorithm for finding minimal volume hyperbolic…

To any prime alternating link, we associate a collection of hyperbolic right-angled ideal polyhedra by relating geometric, topological and combinatorial methods to decompose the link complement. The sum of the hyperbolic volumes of these…

The main theorem of this paper is a generalisation of well known results about Dehn surgery to the case of attaching handlebodies to a simple 3-manifold. The existence of a finite set of `exceptional' curves on the boundary of the…

Suppose n>2, let M,M' be n-dimensional connected complete finite-volume hyperbolic manifolds with non-empty geodesic boundary, and suppose that the fundamental group of M is quasi-isometric to the fundamental group of M' (with respect to…

In hep-th/9805025, a result for the symmetric 3-loop massive tetrahedron in 3 dimensions was found, using the lattice algorithm PSLQ. Here we give a more general formula, involving 3 distinct masses. A proof is devised, though it cannot be…

We construct a hyperbolic 3-manifold $M$ (with $\partial M$ totally geodesic) which contains no essential closed surfaces, but for any even integer $g> 0$ there are infinitely many separating slopes $r$ on $\partial M$ so that $M[r]$, the…

In this paper we study the difference between algebraic and geometric solutions of the hyperbolic Dehn filling equations for ideally triangulated 3-manifolds. We show that any geometric solution is an algebraic one, and we prove the…

The classic lower bound of Kuhn, Moscibroda and Wattenhofer [JACM 2016] states that approximate maximum matching and approximate vertex cover (among other problems) in the LOCAL model require $\Omega(\min\{\sqrt{\frac{\log n}{\log\log n}},…

Let M be an oriented complete hyperbolic n-manifold of finite volume. Using the definition of volume of a representation previously given by the authors in [BucherBurgerIozzi2013] we show that the volume of a representation of the…

We prove that every complete non-compact manifold of finite volume contains a (possibly non-compact) minimal hypersurface of finite volume. The main tool is the following result of independent interest: if a region $U$ can be swept out by a…

Let $(M, \partial M)$ be a compact 3-manifold with boundary which admits a complete, convex co-compact hyperbolic metric. For each hyperbolic metric $g$ on $M$ such that $\dr M$ is smooth and strictly convex, the induced metric on $\dr M$…

This study addresses optimal impulsive trajectory design within the Circular Restricted Three-Body Problem (CR3BP), presenting a global optimization-based approach to identify minimum $\Delta V$ transfers between periodic orbits, including…

It is shown that given any link-manifold, there is an algorithm to decide if the manifold contains an embedded, essential planar surface; if it does, the algorithm will construct one. If a slope on the boundary of the link-manifold is…

We consider arrangements of n connected codimensional one submanifolds in closed d-dimensional manifold M. Let f be the number of connected components of the complement in M to the union of submanifolds. We prove the sharp lower bound for f…

We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…

Let N be a compact, orientable hyperbolic 3-manifold with connected, totally geodesic boundary of genus 2. If N has Heegaard genus at least 5, then its volume is greater than 6.89. The proof of this result uses the following dichotomy:…

We supply a proof of the fact that a hyperbolic 3-manifold $M$ with finitely generated fundamental group and with no parabolics is topologically tame. This proves the Marden's conjecture. Our approach is to form an exhaustion $M_i$ of $M$…

The multiscale hybrid-mixed (MHM) method consists of a multi-level strategy to approximate the solution of boundary value problems with heterogeneous coefficients. In this context, we propose a family of low-order finite elements for the…

Primal and dual algorithms are developed for solving the $n$-dimensional convex optimization problem of finding the Euclidean ball of minimum radius that covers $m$ given Euclidean balls, each with a given center and radius. Each algorithm…

We study the time complexity of the discrete $k$-center problem and related (exact) geometric set cover problems when $k$ or the size of the cover is small. We obtain a plethora of new results: - We give the first subquadratic algorithm for…

We prove there exists a compact embedded minimal surface in a complete finite volume hyperbolic $3$-manifold $\mathcal{N}$. We also obtain a least area, incompressible, properly embedded, finite topology, $2$-sided surface. We prove a…