Related papers: On Net Maps: Examples and Nonexistence Results

This paper makes a deep study of regular two-distance sets. A set of unit vectors $X$ in Euclidean space $\RR^n$ is said to be regular two-distance set if the inner product of any pair of its vectors is either $\alpha$ or $\beta$, and the…

We present two algorithms for large-scale low-rank Euclidean distance matrix completion problems, based on semidefinite optimization. Our first method works by relating cliques in the graph of the known distances to faces of the positive…

For a two-dimensional surface in the four-dimensional Euclidean space we introduce an invariant linear map of Weingarten type in the tangent space of the surface, which generates two invariants k and kappa. The condition k = kappa = 0…

We explore different families of quasi-periodically Forced Logistic Maps for the existence of universality and self-similarity properties. In the bifurcation diagram of the Logistic Map it is well known that there exist parameter values…

In this paper the index of a family of critical points of the systole function on Teichm\"uller space is calculated. The members of this family are interesting in that their existence implies the existence of strata in the Thurston spine…

Semi-Equivelar maps are generalizations of Archimedean Solids (as are equivelar maps of the Platonic solids) to the surfaces other than $2-$Sphere. We classify some semi equivelar maps on surface of Euler characteristic -1 and show that…

We define a universal Teichm\"uller space for locally quasiconformal mappings whose dilatation grows not faster than a certain rate. Paralleling the classical Teichm\"uller theory, we prove results of existence and uniqueness for extremal…

Despite the fact that the loss functions of deep neural networks are highly non-convex, gradient-based optimization algorithms converge to approximately the same performance from many random initial points. One thread of work has focused on…

We study independent and identically distributed random iterations of continuous maps defined on a connected closed subset $S$ of the Euclidean space $\mathbb{R}^{k}$. We assume the maps are monotone (with respect to a suitable partial…

The behavior under iteration of the critical points of polynomial maps plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston's theorem tells us…

We analyze a real one-parameter family of quasiconformal deformations of a hyperbolic rational map known as {\em spinning}. We show that under fairly general hypotheses, the limit of spinning either exists and is unique, or else converges…

We develop non-invertible Pesin theory for a new class of maps called cusp maps. These maps may have unbounded derivative, but nevertheless verify a property analogous to $C^{1+\epsilon}$. We do not require the critical points to verify a…

The minimal network problem is a classical topic in geometric measure theory and the calculus of variations, which aims to find networks of minimal length connecting given points. Most classical results are established in the Euclidean…

We prove the No Invariant Line Fields conjecture for a class of generalized postcritically-finite branched covers on higher-dimensional Riemannian manifolds. Moreover, we establish a quasisymmetric uniformization theorem for this class of…

For many important network types (e.g., sensor networks in complex harsh environments and social networks) physical coordinate systems (e.g., Cartesian), and physical distances (e.g., Euclidean), are either difficult to discern or…

We introduce the notion of fully simple maps, which are maps with non self-intersecting disjoint boundaries. In contrast, maps where such a restriction is not imposed are called ordinary. We study in detail the combinatorics of fully simple…

In a landscape composed of N randomly distributed sites in Euclidean space, a walker (``tourist'') goes to the nearest one that has not been visited in the last \tau steps. This procedure leads to trajectories composed of a transient part…

Liu et al recently proposed a minimum number of driver nodes needed to obtain full structural controllability over a directed network. Driver nodes are unmatched nodes, from which there are directed paths to all matched nodes. Their most…

We prove that any Latt\`es map can be approximated by strictly postcritically finite rational maps which are not Latt\`es maps.

Spatially embedded networks are important in several disciplines. The prototypical spatial net- work we assume is the Random Geometric Graph of which many properties are known. Here we present new results for the two-point degree…