Related papers: Generating Tree Structures for Hyperbolic Tessella…
Processes of random tessellations of the Euclidean space $\mathbb{R}^d$, $d\geq 1$, are considered which are generated by subsequent division of their cells. Such processes are characterized by the laws of the life times of the cells until…
In this article we show that any ergodic rigid system can be topologically realized by a uniformly rigid and (topologically) weak mixing topological dynamical system.
We provide examples of towers of covers of cusped hyperbolic 3-manifolds whose exponential homological torsion growth is explicitly computed in terms of volume growth. These examples arise from abelian covers of alternating links in the…
We produce a large class of hyperbolic homology 3-spheres admitting arbitrarily many distinct tight contact structures. We also produce a sub-class admitting arbitrarily many distinct tight contact structures within the same homotopy class…
We introduce a simple autoencoder based on hyperbolic geometry for solving standard collaborative filtering problem. In contrast to many modern deep learning techniques, we build our solution using only a single hidden layer. Remarkably,…
This text is about geometric structures imposed by robust dynamical behaviour. We explain recent results towards the classification of partially hyperbolic systems in dimension 3 using the theory of foliations and its interaction with…
Let N be a topologically finite, orientable 3-manifold with ideal triangulation. We show that if there is a solution to the hyperbolic gluing equations, then all edges in the triangulation are essential. This result is extended to a…
We describe a technique to reorganize topologies of Steiner trees by exchanging neighbors of adjacent Steiner points. We explain how to use the systematic way of building trees, and therefore topologies, to find the correct topology after…
We introduce a concept of tree-graded metric space and we use it to show quasi-isometry invariance of certain classes of relatively hyperbolic groups, to obtain a characterization of relatively hyperbolic groups in terms of their asymptotic…
We classify the polycyclic totally ordered simple dimension groups, i.e. dimension groups given by a dense embedding of n-dimensional lattice into the real line. Our method is based on the geometry of simple geodesics on the hyperbolic…
A simple approach is presented to study the asymptotic behavior of some algorithms with an underlying tree structure. It is shown that some asymptotic oscillating behaviors can be precisely analyzed without resorting to complex analysis…
This chapter from the upcoming Handbook of Knot Theory (eds. Menasco and Thistlethwaite) shows how to construct hyperbolic structures on link complements and perform hyperbolic Dehn filling. Along with a new elementary exposition of the…
In this paper, we consider the problem of improving 2D triangle meshes tessellating planar regions. We propose a new variational principle for improving 2D triangle meshes where the energy functional is a convex function over the angle…
In this paper I present several novel, efficient, algorithmic techniques for solving some multidimensional geometric data management and analysis problems. The techniques are based on several data structures from computational geometry…
A semi-regular tiling of the hyperbolic plane is a tessellation by regular geodesic polygons with the property that each vertex has the same vertex-type, which is a cyclic tuple of integers that determine the number of sides of the polygons…
In this paper, we give a new lifting construction of "hyperbolic" type of strongly regular Cayley graphs. Also we give new constructions of strongly regular Cayley graphs over the additive groups of finite fields based on partitions of…
We construct geometrically infinite hyperbolic surfaces supporting horocycles with tailored recurrence properties. In particular, we obtain the first examples of non-trivial minimal horocyclic orbit closures and of infinite locally-finite…
Generative network models play an important role in algorithm development, scaling studies, network analysis, and realistic system benchmarks for graph data sets. A complex network model gaining considerable popularity builds random…
We extend to the context of hyperbolic 3-manifolds with geodesic boundary Thurston's approach to hyperbolization by means of geometric triangulations. In particular, we introduce moduli for (partially) truncated hyperbolic tetrahedra, and…
Despite the rapidly evolving field of computational electromagnetics, few open-source tools have managed to tackle the problem of automatic mesh generation for properly discretizing the problem of interest into a finite set of elements…