Related papers: Solving a conjecture about tessellation graphs of …
Tilings of the hyperbolic plane are of significant interest among many branches of mathematics, physics and computer science. Yet, their construction remains a non-trivial task. Current approaches primarily use tree-based recursive…
We investigate properties of spatial graphs on the standard torus. It is known that nontrivial embeddings of planar graphs in the torus contain a nontrivial knot or a nonsplit link due to [1],[2]. Building on this and using the chirality of…
Let $\mathbb{H}^n$ be the $n-$dimensional hyperbolic space. It is well known that, if $f: \mathbb{H}^n\to \mathbb{H}^n$ is a bijection that preserves $r-$dimensional hyperplanes, then $f$ is an isometry. In this paper we make neither…
We prove that the separating curve graph of a connected, compact, orientable surface with genus at least 3 and a single boundary component is not relatively hyperbolic. This completes the classification of when the separating curve graph is…
In this paper we consider the isoptic curves on the 2-dimensional geometries of constant curvature $\bE^2,~\bH^2,~\cE^2$. The topic is widely investigated in the Euclidean plane $\bE^2$ see for example \cite{CMM91} and \cite{Wi} and the…
We exhibit orbits of the geodesic flow on a hyperbolic surface with at least one cusp such that every tubular neighborhood contains uncountably many distinct geodesic flow orbits. The proof relies on new phenomena, namely the existence of…
In this paper we present new results regarding the periodicity of outer billiards in the hyperbolic plane around polygonal tables which are tiles in regular two-piece tilings of the hyperbolic plane.
In this paper we use theoretical and computational tools to continue our investigation of $K_2$-hamiltonian graphs, that is, graphs in which the removal of any pair of adjacent vertices yields a hamiltonian graph, and their interplay with…
A circuit double cover of a bridgeless graph is a collection of even subgraphs such that every edge is contained in exactly two subgraphs of the given collection. Such a circuit double cover describes an embedding of the corresponding graph…
Learning graph representations via low-dimensional embeddings that preserve relevant network properties is an important class of problems in machine learning. We here present a novel method to embed directed acyclic graphs. Following prior…
Hensel-Przytycki-Webb proved that all curve graphs of orientable surfaces are 17-hyperbolic. In this paper, we show that curve graphs of non-orientable surfaces are 17-hyperbolic by applying Hensel-Przytycki-Webb's argument. We also show…
The edge of torn elastic sheets and growing leaves often form a hierarchical buckling pattern. Within non-Euclidean plate theory this complex morphology can be understood as low bending energy isometric immersions of hyperbolic Riemannian…
In this paper, we prove that any non-positively curved 2-dimensional surface (alias, Busemann surface) is isometrically embeddable into $L_1$. As a corollary, we obtain that all planar graphs which are 1-skeletons of planar non-positively…
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than 180 degrees. In this paper we prove that the opposite statement is also true, namely that planar…
A periodic weave is the lift of a particular link embedded in a thickened surface to the universal cover. Its components are infinite unknotted simple open curves that can be partitioned in at least two distinct sets of threads. The…
The purpose the present paper is to construct the hyperbolic trigonometry on Euclidean plane without refereing to hyperbolic plane. In this paper we show that the concept of hyperbolic angle and its functions forming the hyperbolic…
Given a quadratically convex compact connected oriented hypersurface $N$ of the complex hyperbolic plane, we prove that the characteristic rays of the symplectic form restricted to $N$ determine a double geodesic foliation of the exterior…
Graph pebbling is a network optimization model for satisfying vertex demands with vertex supplies (called pebbles), with partial loss of pebbles in transit. The pebbling number of a demand in a graph is the smallest number for which every…
We prove that the Hilbert geometry of a convex domain in the plane is Gromov hyperbolic, if, and only if, the bottom of its spectrum is not zero
Abstractly, tropical hyperelliptic curves are metric graphs that admit a two-to-one harmonic morphism to a tree. They also appear as embedded tropical curves in the plane arising from triangulations of polygons with all interior lattice…