Related papers: From rubber bands to rational maps: A research rep…
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…
In the Teichm\"uller space of a hyperbolic surface of finite type, we construct geodesic lines for Thurston's asymmetric metric having the property that when they are traversed in the reverse direction, they are also geodesic lines (up to…
A rational map $f:\widehat{\mathbb{C}}\to\widehat{\mathbb{C}}$ on the Riemann sphere $\widehat{\mathbb{C}}$ is called critically fixed if each critical point of $f$ is fixed under $f$. In this article, we study the properties of a…
We prove that the ends of a properly immersed simply or one connected minimal surface in H(2)xR contained in a slab of height less than \pi of H(2)xR, are multi-graphs. When such a surface is embedded then the ends are graphs. When embedded…
We prove a result on the structure of finite proper holomorphic mappings between complex manifolds that are products of hyperbolic Riemann surfaces. While an important special case of our result follows from the ideas developed by Remmert…
Given a periodic graph, we wish to determine via combinatorial methods whether it has periodic embeddings in the plane that -- via motions that preserve edge-lengths and periodicity -- can be continuously deformed into another non-congruent…
Predicting missing links between entities in a knowledge graph is a fundamental task to deal with the incompleteness of data on the Web. Knowledge graph embeddings map nodes into a vector space to predict new links, scoring them according…
We present a quantum ergodicity theorem for fixed spectral window and sequences of compact hyperbolic surfaces converging to the hyperbolic plane in the sense of Benjamini and Schramm. This addresses a question posed by Colin de…
We provide a diagrammatic criterion for semi-adequate links to be hyperbolic. We also give a conjectural description of the satellite structures of semi-adequate links. One application of our result is that the closures of sufficiently…
For causal discovery in the presence of latent confounders, constraints beyond conditional independences exist that can enable causal discovery algorithms to distinguish more pairs of graphs. Such constraints are not well-understood yet. In…
A graph product kernel means the kernel of the natural surjection from a graph product to the corresponding direct product. We prove that a graph product kernel of countable groups is special, and a graph product of finite or cyclic groups…
In this paper, we study fan-planar drawings that use $h$ layers and are proper, i.e., edges connect adjacent layers. We show that if the embedding of the graph is fixed, then testing the existence of such drawings is fixed-parameter…
Learning low-dimensional numerical representations from symbolic data, e.g., embedding the nodes of a graph into a geometric space, is an important concept in machine learning. While embedding into Euclidean space is common, recent…
Carrier graphs of groups representing subgroups of a given relatively hyperbolic groups are introduced and a combination theorem for relatively quasi-convex subgroups is proven. Subsequently a theory of folds for such carrier graphs is…
Learning embeddings of entities and relations existing in knowledge bases allows the discovery of hidden patterns in data. In this work, we examine the geometrical space's contribution to the task of knowledge base completion. We focus on…
A rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint…
We demonstrate that the question whether or not a given postcritically finite topological ramified covering map of the 2-sphere is Thurston equivalent to a rational map is algorithmically decidable.
Leighton's Graph Covering Theorem states that if two finite graphs have the same universal covering tree, then they also have a common finite degree cover. Bass and Kulkarni gave an alternative proof of this fact using tree lattices. We…
Linking the fundamental physics of band structure and scattering theory with macroscopic features such as measurable bulk thermoelectric transport properties is indispensable to a thorough understanding of transport phenomena and ensures…
Embedded topic models are able to learn interpretable topics even with large and heavy-tailed vocabularies. However, they generally hold the Euclidean embedding space assumption, leading to a basic limitation in capturing hierarchical…