Related papers: Degrees of maps and multiscale geometry

We study continuous maps between differential manifolds from a microlocal point of view. In particular, we characterize the Lipschitz continuity of these maps in terms of the microsupport of the constant sheaf on their graph. Furthermore,…

We give a metric characterization of the scalar curvature of a smooth Riemannian manifold, analyzing the maximal distance between $(n+1)$ points in infinitesimally small neighborhoods of a point. Since this characterization is purely in…

We consider the Dirichlet boundary value problem for graphical maximal submanifolds inside Lorentzian type ambient spaces, and obtain general existence and uniqueness results which apply to any codimension.

We show that if a compact, connected, and oriented $n$-manifold $M$ without boundary admits a non-constant non-injective uniformly quasiregular self-map, then the dimension of the real singular cohomology ring $H^*(M; \mathbb{R})$ of $M$ is…

A graph $G$ is terminal-pairable with respect to a demand multigraph $D$ on the same vertex set as $G$, if there exists edge-disjoint paths joining the end vertices of every demand edge of $D$. In this short note, we improve the upper bound…

We study the problem of maximizing the $k$-th eigenvalue functional over the class of absolutely continuous measures on a closed Riemannian manifold of dimension $m\geq 3$. For dimensions $3 \leq m \leq 6$, we generalize the work of…

Shapes of four dimensional spaces can be studied effectively via maps to standard surfaces. We explain, and illustrate by quintessential examples, how to simplify such generic maps on 4-manifolds topologically, in order to derive simple…

We study collections of exact Lagrangian submanifolds respecting some uniform Riemannian bounds, which we equip with a metric naturally arising in symplectic topology (e.g. the Lagrangian Hofer metric or the spectral metric). We exhibit…

We prove that if a tree $T$ has $n$ vertices and maximum degree at most $\Delta$, then a copy of $T$ can almost surely be found in the random graph $\mathcal{G}(n,\Delta\log^5 n/n)$.

In Fialowski's classification for algebras of maximal class, there are three Lie algebras of maximal class with 1-dimensional homogeneous components: $\mathfrak{m}_0$, $L_1$ and $\mathfrak{m}_2$. In this paper, we studied their…

Lipschitz learning is a graph-based semi-supervised learning method where one extends labels from a labeled to an unlabeled data set by solving the infinity Laplace equation on a weighted graph. In this work we prove uniform convergence…

A link of an isolated singularity of a two-dimensional semialgebraic surface in $R^4$ is a knot (or a link) in $S^3$. Thus the ambient Lipschitz classification of surface singularities in $R^4$ can be interpreted as a bi-Lipschitz…

Let $R$ and $B$ be two disjoint sets of points in the plane such that $|B|\leqslant |R|$, and no three points of $R\cup B$ are collinear. We show that the geometric complete bipartite graph $K(R,B)$ contains a non-crossing spanning tree…

It is a classical important problem of differential topology by Thom; for a homology class of a compact manifold, can we realize this by a closed submanifold with no boundary? This is true if the degree of the class is smaller or equal to…

We characterise the structure of those graphs of a given order which maximise the number of connected induced subgraphs for seven different graph classes, each with other prescribed parameters like minimum degree, independence number,…

Given a positive integer $p$, we consider $W^{1,p}$-maps from a Euclidean domain of dimension $p+1$ into a closed Riemannian manifold $\mathcal{N}$. The target manifold is required to satisfy suitable topological conditions; in particular,…

Cross-ratio degrees count configurations of points $z_1,\ldots, z_n \in \mathbb{P}^1$ satisfying $n - 3$ cross-ratio constraints, up to isomorphism. These numbers arise in multiple contexts in algebraic and tropical geometry, and may be…

Call a colouring of a graph distinguishing, if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a graph $G$ moves infinitely many vertices, then there is a distinguishing…

The local minimum degree of a graph is the minimum degree that can be reached by means of local complementation. For any n, there exist graphs of order n which have a local minimum degree at least 0.189n, or at least 0.110n when restricted…

In this paper, we study degree conditions for three types of disjoint directed path cover problems: many-to-many $k$-DDPC, one-to-many $k$-DDPC and one-to-one $k$-DDPC, which are intimately connected to other famous topics in graph theory,…