Building hyperbolic metrics suited to closed curves and applications to lifting simply
نویسندگان
چکیده
منابع مشابه
Lifting curves simply
Let fρ(L) indicate the smallest integer so that every curve on a fixed hyperbolic surface (S, ρ) of length at most L lifts to a simple curve on a cover of degree at most fρ(L). We provide linear lower bounds for fρ(L), improving a recent result of Gupta-Kapovich [6]. When (S, ρ) is without punctures, using work of Patel [9] and Lenzhen-Rafi-Tao [7] we conclude that fρ(L)/L grows like the recipr...
متن کاملObstructions to Lifting Tropical Curves in Hypersurfaces
Tropicalization takes a curve in a hypersurface in 3-space to a balanced rational weighted graph in a tropical surface. In this paper, we study the ‘lifting’ problem: given a graph in a tropical surface, can one find a corresponding algebraic curve in a hypersurface? We develop specific combinatorial obstructions to a graph lifting by studying the factorizations of polynomials with particular N...
متن کاملHomology of Curves and Surfaces in Closed Hyperbolic 3-manifolds
Among other things, we prove the following two topologcal statements about closed hyperbolic 3-manifolds. First, every rational second homology class of a closed hyperbolic 3-manifold has a positve integral multiple represented by an oriented connected closed π1-injectively immersed quasiFuchsian subsurface. Second, every rationally null-homologous, π1-injectively immersed oriented closed 1-sub...
متن کاملProducts of Euclidean metrics and applications to proximity questions among curves
The problem of Approximate Nearest Neighbor (ANN) search is fundamental in computer science and has benefited from significant progress in the past couple of decades. However, most work has been devoted to pointsets whereas complex shapes have not been sufficiently treated. Here, we focus on distance functions between discretized curves in Euclidean space: they appear in a wide range of applica...
متن کاملMetrics to Characterize Parallel Applications
When computer architects re-invented parallelism through multi-core processors, application parallelization became mandatory. The challenge of “mass-parallelization” forced the software community to react quickly. Unfortunately, instead of tackling such a large-scale problem in a systematic way, we have rather experienced various random search, non-portable and non-reusable approaches. We belie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Research Letters
سال: 2017
ISSN: 1073-2780,1945-001X
DOI: 10.4310/mrl.2017.v24.n3.a1