Related papers: Degrees of maps and multiscale geometry

We consider epimorphisms and several variant notions -- split, effective, regular, strong, and extremal -- and determine which of these coincide in the metric coarse and coarsely Lipschitz categories. In particular, we characterise extremal…

In low dimensional topology, we have some invariants defined by using solutions of some nonlinear elliptic operators. The invariants could be understood as Euler class or degree in the ordinary cohomology, in infinite dimensional setting.…

The dynamical degrees of a rational map $f:X\dashrightarrow X$ are fundamental invariants describing the rate of growth of the action of iterates of $f$ on the cohomology of $X$. When $f$ has nonempty indeterminacy set, these quantities can…

We define the discrete degree of symmetry $disc-sym(X)$ of a closed $n$-manifold $X$ as the biggest $m\geq 0$ such that $X$ supports an effective action of $({\mathbf Z}/r)^m$ for arbitrarily big values of $r$. We prove that if $X$ is…

In the usual setup, the grading on Floer homology is relative: it is unique only up to adding a constant. "Graded Lagrangian submanifolds" are Lagrangian submanifolds with a bit of extra structure, which fixes the ambiguity in the grading.…

We prove that the next possible dimension after the maximal $n^2+2n$ for the Lie algebra of local projective symmetries of a metric on a manifold of dimension $n>1$ is $n^2-3n+5$ if the signature is Riemannian or $n=2$, $n^2-3n+6$ if the…

We study the degree landscape of the partition graph $G_n$, whose vertices are the integer partitions of $n$ and whose edges correspond to elementary transfers of one unit between parts, followed by reordering. Using the previously…

We give new upper bounds for the number of nonconstant holomorphic maps depending only on the genus. Our estimates improve previously known bounds. The proof is based on the study of pullbacks of holomorphic differentials, together with…

We develop a theory of large scale geometry of metrisable topological groups that, in a significant number of cases, allows one to define and identify a unique quasi-isometry type intrinsic to the topological group. Moreover, this…

Over some types of trees with a given number of vertices, which trees minimize or maximize the total number of subtrees or leaf containing subtrees are studied. Here are some of the main results:\ (1)\, Sharp upper bound on the total number…

We prove that simply connected open Riemannian manifolds of bounded geometry, linear growth and sublinear filling growth (e.g. finite filling area) are simply connected at infinity.

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

We construct infinite families of non-simply connected locally conformally flat (LCF) 4-manifolds realizing rich topological types. These manifolds have strictly negative scalar curvature and the underlying topological 4-manifolds do not…

A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the…

The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…

In this paper we define, for each aspherical orientable 3-manifold $M$ endowed with a \emph{torus splitting} $\c{T}$, a 2-dimensional fundamental $l_1$-class $[M]^{\c{T}}$ whose $l_1$-norm has similar properties as the Gromov simplicial…

We first introduce the class of quasi-algebraically stable meromorphic maps of $\P^k.$ This class is strictly larger than that of algebraically stable meromorphic self-maps of $\P^k.$ Then we prove that all maps in the new class enjoy a…

An almost self-centered graph is a connected graph of order $n$ with exactly $n-2$ central vertices, and an almost peripheral graph is a connected graph of order $n$ with exactly $n-1$ peripheral vertices. We determine (1) the maximum girth…

In this paper, we introduce the n-th discrete topological complexity and study its properties such as its relation with simplicial Lusternik-Schnirelmann category and how the higher dimensions of discrete topological complexity relate with…

In the paper we investigate the degree and the homotopy theory of Orlicz-Sobolev mappings $W^{1,P}(M,N)$ between manifolds, where the Young function $P$ satisfies a divergence condition and forms a slightly larger space than $W^{1,n}$,…