Related papers: From rubber bands to rational maps: A research rep…
Renormalizations can be considered as building blocks of complex dynamical systems. This phenomenon has been widely studied for iterations of polynomials of one complex variable. Concerning non-polynomial hyperbolic rational maps, a recent…
Using particle-scale models to accurately describe property enhancements and phase transitions in macroscopic behavior is a major engineering challenge in composite materials science. To address some of these challenges, we use the graph…
In this paper, we establish a new criterion for covering maps between real algebraic varieties. Specifically, we prove that a quasi-finite, flat morphism with locally constant geometric fibers between varieties over a real closed field…
In structural rigidity, one studies frameworks of bars and joints in Euclidean space. Such a framework is an articulated structure consisting of rigid bars, joined together at joints around which the bars may rotate. In this paper, we will…
A hypermap is an embedding of a connected hypergraph into an orientable closed surface. A covering between hypermaps is a homomorphism between the embedded hypergraphs which extends to an orientation-preserving covering of the supporting…
In this paper we develop a framework to study observability for uniform hypergraphs. Hypergraphs, being extensions of graphs, allow edges to connect multiple nodes and unambiguously represent multi-way relationships which are ubiquitous in…
Learning fine-grained embeddings from coarse labels is a challenging task due to limited label granularity supervision, i.e., lacking the detailed distinctions required for fine-grained tasks. The task becomes even more demanding when…
Knowledge graph completion aims to predict the new links in given entities among the knowledge graph (KG). Most mainstream embedding methods focus on fact triplets contained in the given KG, however, ignoring the rich background information…
We show that for any closed surface of genus greater than one and for any finite weighted graph filling the surface, there exists a hyperbolic metric which realizes the least Dirichlet energy harmonic embedding of the graph among a fixed…
William Thurston (1946-2012) gave a combinatorial characterization for generic branched self-coverings of the two-sphere by associating a planar graph to them 10.48550/arXiv.1502.04760. By generalizing the notion of local balancing, the…
Kendall's Similarity Shape Theory for constellations of N points in the carrier space $\mathbb{R}^d$ as quotiented by the similarity group was developed for use in Probability and Statistics. It was subsequently shown to reside within…
Neural embeddings have been used with great success in Natural Language Processing (NLP). They provide compact representations that encapsulate word similarity and attain state-of-the-art performance in a range of linguistic tasks. The…
We show that the community structure of a network can be used as a coarse version of its embedding in a hidden space with hyperbolic geometry. The finding emerges from a systematic analysis of several real-world and synthetic networks. We…
Generalising an example by Girondo and Wolfart, we use finite group theory to construct Riemann surfaces admitting two or more regular dessins (i.e. orientably regular hypermaps) with automorphism groups of the same order, and in many cases…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
Natural language text exhibits hierarchical structure in a variety of respects. Ideally, we could incorporate our prior knowledge of this hierarchical structure into unsupervised learning algorithms that work on text data. Recent work by…
Let $K$ denote either $\mathbb{R}$ or $\mathbb{C}$. In this article, we introduce two new equivariants associated to a rational map $f\in K(z)$. These objects naturally live on a real hyperbolic space, and carry information about the action…
This paper introduces epistemic graphs as a generalization of the epistemic approach to probabilistic argumentation. In these graphs, an argument can be believed or disbelieved up to a given degree, thus providing a more fine--grained…
Initial steps in the study of inner expansion properties of infinite Cayley graphs and other infinite graphs, such as hyperbolic ones, are taken, in a flavor similar to the well-known Lipton-Tarjan square root separation result for planar…
In this note we prove that if a finitely generated amenable group admits a regular map to a direct product of a hyperbolic space and a euclidean space, then it must be virtually nilpotent. We deduce that an amenable group regularly embeds…