Related papers: Generating Regular Hyperbolic Honeycombs
We give a sufficient condition under which the fundamental group of a reglued graph of surfaces is hyperbolic. A reglued graph of surfaces is constructed by cutting a fixed graph of surfaces along the edge surfaces, then regluing by…
We consider tessellations of the Euclidean $(d-1)$-sphere by $(d-2)$-dimensional great subspheres or, equivalently, tessellations of Euclidean $d$-space by hyperplanes through the origin; these we call conical tessellations. For random…
Graph representation learning in Euclidean space, despite its widespread adoption and proven utility in many domains, often struggles to effectively capture the inherent hierarchical and complex relational structures prevalent in real-world…
Hypergraphs have been becoming a popular choice to model complex, non-pairwise, and higher-order interactions for recommender system. However, compared with traditional graph-based methods, the constructed hypergraphs are usually much…
We derive basic differential geometric formulae for surfaces in hyperbolic space represented as envelopes of horospheres. The dual notion of parallel hypersurfaces is also studied. The representation is applied to prove existence and…
Stochastic embeddings of finite metric spaces into graph-theoretic trees have proven to be a vital tool for constructing approximation algorithms in theoretical computer science. In the present work, we build out some of the basic theory of…
We prove that every complete finite-volume hyperbolic 3-manifold $M$ that is tessellated into (embedded) right-angled regular polyhedra (dodecahedra or ideal octahedra) embeds geodesically in a complete finite-volume connected orientable…
This paper introduces a method of calculating and rendering shapes in a non-Euclidean 2D space. In order to achieve this, we developed a physics and graphics engine that uses hyperbolic trigonometry to calculate and subsequently render the…
Hyperbolic representations have shown remarkable efficacy in modeling inherent hierarchies and complexities within data structures. Hyperbolic neural networks have been commonly applied for learning such representations from data, but they…
The complete quantum theory of closed superstrings is constructed using string diagrams endowed with metric having constant curvature $-1$. The elementary string diagrams are equipped with the analytic local coordinates induced from the…
Graph-structured data are widespread in real-world applications, such as social networks, recommender systems, knowledge graphs, chemical molecules etc. Despite the success of Euclidean space for graph-related learning tasks, its ability to…
We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with…
Higher-dimensional spaces are ubiquitous in applications of mathematics. Yet, as we live in a three-dimensional space, visualizing, say, a four-dimensional space is challenging. We introduce a novel method of interactive visualization of…
For every hyperbolic group and more general hyperbolic graphs, we construct an equivariant ideal bicombing: this is a homological analogue of the geodesic flow on negatively curved manifolds. We then construct a cohomological invariant…
Hyperbolic networks are supposed to be congruent with their underlying latent geometry and following geodesics in the hyperbolic space is believed equivalent to navigate through topological shortest paths (TSP). This assumption of…
We discuss complex Farey graphs for the Euclidean imaginary quadratic number fields $\mathbb Q(\sqrt{-d})$, $d\in\{1, 2, 3, 7, 11\}$. We study hyperbolic versions of A. Schmidt's Farey polygons living in $3$-dimensional hyperbolic space…
Barycentric coordinates are commonly used in Euclidean geometry. Following the adaptation of barycentric coordinates for use in hyperbolic geometry in recently published books on analytic hyperbolic geometry, known and novel results…
For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…
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…
Continual learning has traditionally focused on classifying either instances or classes, but real-world applications, such as robotics and self-driving cars, require models to handle both simultaneously. To mirror real-life scenarios, we…