Related papers: Recognizing Unit Disk Graphs in Hyperbolic Geometr…
Label inventories for fine-grained entity typing have grown in size and complexity. Nonetheless, they exhibit a hierarchical structure. Hyperbolic spaces offer a mathematically appealing approach for learning hierarchical representations of…
Let $\mathbb{R}_{+}^{n+1}$ \ be the half-space model of the hyperbolic space $\mathbb{H}^{n+1}.$ It is proved that if $\Gamma\subset\left\{ x_{n+1}=0\right\} \subset\partial_{\infty}\mathbb{H}^{n+1}$ is a bounded $C^{0}$ Euclidean graph…
This is an announcement of some of the results obtained as a part of the second author's Ph.D. thesis. In the first part, we prove that the fundamental group of an acylindrical complex of hyperbolic groups with finite edge groups is…
A (simple) hypergraph is a family H of pairwise incomparable sets of a finite set. We say that a hypergraph H is a domination hypergraph if there is at least a graph G such that the collection of minimal dominating sets of G is equal to H.…
A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar. A unipolar partition of a graph can be used to find efficiently the…
Over the past twenty years, rectangle visibility graphs have generated considerable interest, in part due to their applicability to VLSI chip design. Here we study unit rectangle visibility graphs, with fixed dimension restrictions more…
Let $f$ be an analytic function on the unit disc which is in the Dirichlet class, so the Euclidean area of the image, counting multiplicity, is finite. The Euclidean length of a radial arc of hyperbolic length $\rho$ is then $o(\rho^1/2)$.…
It is known that the hyperbolic plane admits a countable infinity of compactifications into a closed disk such that the isometric action of SL(2;R) acts analytically on the compactified space. We prove that among those compactifications,…
Let $G$ be a relatively hyperbolic group that admits a decomposition into a finite graph of relatively hyperbolic groups structure with quasi-isometrically (qi) embedded condition. We prove that the set of conjugates of all the vertex and…
Consider a unimodular random planar map (URM) with an invariant ergodic percolation having infinite primal and dual clusters. We say that there is half-plane coexistence if both the percolation and its dual have infinite clusters when…
A {\em faithful (unit) distance graph} in $\mathbb{R}^d$ is a graph whose set of vertices is a finite subset of the $d$-dimensional Euclidean space, where two vertices are adjacent if and only if the Euclidean distance between them is…
A graph is called (generically) rigid in R^d if, for any choice of sufficiently generic edge lengths, it can be embedded in R^d in a finite number of distinct ways, modulo rigid transformations. Here, we deal with the problem of determining…
Using a hyperbolic complex plane, we study the realization of the underlying hyperbolic symmetry as an internal symmetry that enables the unification of scalar fields of cosmological and particle physics interest. Such an unification is…
In many cases, analytic solutions of partial differential equations may not be possible. For practical problems, it is more reasonable to carry out computational solutions. However, the standard grid in the finite difference approximation…
Unigraphs are graphs identifiable up to isomorphism from their degree sequences. Given a class $\mathcal{A}$ of graphs, we define the class of $\mathcal{A}$-unigraphs to be graphs identifiable from degree sequence and membership in…
The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially-filled tensors subject to rank…
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…
For a family $\mathcal{C}$ of properly embedded curves in the 2-dimensional disk $\mathbb{D}^{2}$ satisfying certain uniqueness properties, we consider convex polygons $P\subset \mathbb{D}^{2}$ and define a metric $d$ on $P$ such that…
The consideration of the so-called rotation minimizing frames allows for a simple and elegant characterization of plane and spherical curves in Euclidean space via a linear equation relating the coefficients that dictate the frame motion.…
An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-line segment connecting the points corresponding to two…