Related papers: Quasi-Isometric Reductions Between Infinite String…

The large-scale geometry of hyperbolic metric spaces exhibits many distinctive features, such as the stability of quasi-geodesics (the Morse Lemma), the visibility property, and the homeomorphism between visual boundaries induced by a…

Cosmic strings are one-dimensional topological defects which could have been formed in the early stages of our Universe. They triggered a lot of interest, mainly for their cosmological implications: they could offer an alternative to…

In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree…

We give a method of constructing maps between tubular groups inductively according to a set of strategies. This map will be a quasi-isometry exactly when the set of strategies is consistent. Conversely, if there exists a quasi-isometry…

We propose a construction of string cohomology spaces for Calabi-Yau hypersurfaces that arise in Batyrev's mirror symmetry construction. The spaces are defined explicitly in terms of the corresponding reflexive polyhedra in a…

We define twistorial topological strings by considering tt* geometry of the 4d N=2 supersymmetric theories on the Nekrasov-Shatashvili half-Omega background, which leads to quantization of the associated hyperKahler geometries. We show that…

We show that quasi-isometries of (well-behaved) hierarchically hyperbolic groups descend to quasi-isometries of their maximal hyperbolic space. This has two applications, one relating to quasi-isometry invariance of acylindrical…

We study geometric and topological properties of infinite graphs that are quasi-isometric to a planar graph of bounded degree. We prove that every locally finite quasi-transitive graph excluding a minor is quasi-isometric to a planar graph…

We explore the notion of isometries in non-Riemannian geometries. Such geometries include and generalise the backgrounds of non-relativistic string theory, and they can be naturally described using the formalism of double field theory.…

Let G and F be finitely generated groups with infinitely many ends and let A and B be graph of groups decompositions of F and G such that all edge groups are finite and all vertex groups have at most one end. We show that G and F are…

We show that the fundamental groups of any two closed irreducible non-geometric graph-manifolds are quasi-isometric. This answers a question of Kapovich and Leeb. We also classify the quasi-isometry types of fundamental groups of…

We prove the equivalence between a relative bottleneck property and being quasi-isometric to a tree-graded space. As a consequence, we deduce that the quasi-trees of spaces defined axiomatically by Bestvina-Bromberg-Fujiwara are…

Finite linear least squares is one of the core problems of numerical linear algebra, with countless applications across science and engineering. Consequently, there is a rich and ongoing literature on algorithms for solving linear least…

The non-linear nature of string theory on non-trivial backgrounds related to the AdS/CFT correspondence suggests to look for simplifications. Two such simplifications proved to be useful in studying string theory. These are the pp-wave…

A quasihomomorphism is a map that satisfies the homomorphism relation up to bounded error. Fujiwara and Kapovich proved a rigidity result for quasihomomorphisms taking values in discrete groups, showing that all quasihomomorphisms can be…

We report the first observation of multiple intercommutation (more than two successive reconnections) of cosmic strings at ultra-high collision speeds, and the formation of ``kink trains'' with up to four closely spaced left- or…

In string theory it is known that abelian isometries in the sigma model lead to target space duality. We generalize this duality to backgrounds with non--abelian isometries. The procedure we follow consists of gauging the isometries of the…

The Lattice String Approximation algorithm (or LSA algorithm) of M. L. Lapidus and M. van Frankenhuijsen is a procedure that approximates the complex dimensions of a nonlattice self-similar fractal string by the complex dimensions of a…

In this paper we provide two new constructions that are useful for the theory of projection complexes developed by Bestvina, Bromberg, Fujiwara and Sisto. We prove that there exists a subtree of the projection complex which is…

The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a…