Related papers: Degrees of maps and multiscale geometry

In this paper, it is shown that every orientable closed 3-manifold maps with nonzero degree onto at most finitely many homeomorphically distinct irreducible non-geometric orientable closed 3-manifolds. Moreover, given any nonzero integer,…

We prove that the maximum degree $\Delta_n$ of a random series-parallel graph with $n$ vertices satisfies $\Delta_n/\log n \to c$ in probability, and $\mathbb{E}\, \Delta_n \sim c \log n$ for a computable constant $c>0$. The same result…

We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. All of our algorithms run in O(n) time, where n is the number of vertices in the graph. In our proofs, we present an embedding algorithm for…

For a graph $G$, let $c_k(G)$ be the number of spanning trees of $G$ with maximum degree at most $k$. For $k \ge 3$, it is proved that every connected $n$-vertex $r$-regular graph $G$ with $r \ge \frac{n}{k+1}$ satisfies $$ c_k(G)^{1/n} \ge…

For a given pair of maps f,g:X->M from an arbitrary topological space to an n-manifold, the Lefschetz homomorphism is a certain graded homomorphism L:H(X)->H(M) of degree (-n). We prove a Lefschetz-type coincidence theorem: if the Lefschetz…

If A is a graded connected algebra then we define a new invariant, polydepth A, which is finite if $Ext_A^*(M,A) \neq 0$ for some A-module M of at most polynomial growth. Theorem 1: If f : X \to Y is a continuous map of finite category, and…

We show that a complete embedded maximal surface in the 3-dimensional Lorentz-Minkowski space $L^3$ with a finite number of singularities is, up to a Lorentzian isometry, an entire graph over any spacelike plane asymptotic to a vertical…

We investigate the bounds on algebraic connectivity of graphs subject to constraints on the number of edges, vertices, and topology. We show that the algebraic connectivity for any tree on $n$ vertices and with maximum degree $d$ is bounded…

Token ring topology has been frequently used in the design of distributed loop computer networks and one measure of its performance is the diameter. We propose an algorithm for constructing hamiltonian graphs with $n$ vertices and maximum…

Let $f:G_{n,k}\longrightarrow G_{m,l}$ be any continuous map between any two distinct complex Grassmann manifolds of the same dimension where the target is not the complex projective space. We show that, for any given $k,l$, the degree of…

We describe a singular variety associated to the smallest degree Pinchuk map and calculate its intersection homology. The result describes the geometry at infinity of the Pinchuk's map.

Assume that there exists a smooth map between two closed manifolds $M^m\to N^k$ with only finitely many cone-like singular points, where $2\leq k\leq m\leq 2k-1$. If $(m,k)\not\in\{(2,2), (4,3), (5,3), (8,5), (16,9)\}$, then $M^m$ admits a…

We determine the possible maximum degrees of a minimally hamiltonian-connected graph with a given order. This answers a question posed by Modalleliyan and Omoomi in 2016. We also pose two unsolved problems.

Let K and L be disjoint closed oriented submanifolds of the n-sphere, with dimensions adding up to n-1. We define a map from their join K*L to the n-sphere whose degree up to sign equals their linking number, and then use this to find the…

We construct natural selfmaps of compact cohomgeneity one manifolds with finite Weyl group and compute their degrees and Lefschetz numbers. On manifolds with simple cohomology rings this yields in certain cases relations between the order…

The problem of finding the largest connected subgraph of a given undirected host graph, subject to constraints on the maximum degree $\Delta$ and the diameter $D$, was introduced in \cite{maxddbs}, as a generalization of the Degree-Diameter…

For the partition graph $G_n$ on the set of partitions of $n$, we study the stratification induced by the local simplex dimension $\dim_{\mathrm{loc}}(\lambda)$, defined as the maximal dimension of a simplex of the clique complex…

If Pi: M -> B is an onto smooth maximal rank map between complete Riemannian manifolds M and B with bounded geometry, we prove sufficient conditions for M to be roughly isometric to the Riemannian product FxB, where F is a fiber of M.

Given a statistical model, the maximum likelihood degree is the number of complex solutions to the likelihood equations for generic data. We consider discrete algebraic statistical models and study the solutions to the likelihood equations…

We prove existence of maximal entropy measures for an open set of non-uniformly expanding local diffeomorphisms on a compact Riemannian manifold. In this context the topological entropy coincides with the logarithm of the degree, and these…