相关论文: A Sard theorem for Tame Set-Valued mappings

A Belyi map $\beta: \mathbb{P}^1(\mathbb{C}) \to \mathbb{P}^1(\mathbb{C})$ is a rational function with at most three critical values; we may assume these values are $\{ 0, \, 1, \, \infty \}$. Replacing $\mathbb{P}^1$ with an elliptic curve…

The critical loci of a map $f:X\to Y$ between smooth schemes over a field $k$ are the locally closed subschemes $\Sigma^i(f)\subseteq X$ where the differential of $f$ has constant rank. We prove that if $f : X\to \mathbb A^r$ is the general…

Let $\mathbb F$ be an algebraically closed field of characteristic $p\ge 0$, which is complete with respect to a non-Archimedean absolute value. Let $V$ be a projective subvariety of $\mathbb P^M(\mathbb F)$. In this paper, we will prove…

The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…

This paper concerns various models of ``at-most-$n$-valued maps''. That is, multivalued maps $f:X\multimap Y$ for which $f(x)$ has cardinality at most $n$ for each $x$. We consider 4 classes of such maps which have appeared in the…

Baker and Rumely's tau lower bound conjecture claims that if the tau constant of a metrized graph is divided by its total length, this ratio must be bounded below by a positive constant for all metrized graphs. We construct several families…

A graph $G$ of order $n$ is said to be $k$-factor-critical for integers $1\leq k< n$, if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph is minimal if for every edge, the deletion of…

We describe a class of sharply o-minimal structures, called analytically generated structures, whose definable sets and their complexity filtration are determined by the collection of definable complex cells. We prove a polynomially…

Let $f,g:X \to Y$ be continuous mappings. We say that $f$ is topologically equivalent to $g$ if there exist homeomorphisms $\Phi : X\to X$ and $\Psi: Y\to Y$ such that $\Psi\circ f\circ \Phi=g.$ Let $X,Y$ be complex smooth irreducible…

A continuous map from R^m to R^N or from C^m to C^N is called k-regular if the images of any $k$ points are linearly independent. Given integers m and k a problem going back to Chebyshev and Borsuk is to determine the minimal value of N for…

Definable topological groups whose topologies are affine have definable $\mathcal C^r$ structures in d-minimal expansions of ordered fields, where $r$ is a positive integer. We prove this fact using a new notion called partition degree of a…

Menger's Theorem is a fundamental result in graph theory. It states that if in a graph $G$ with distinguished sets of terminal vertices $S$ and $T$ there are no $k$ pairwise vertex-disjoint $S$-$T$ paths, then there is a set of less than…

We introduce several classes of set-valued maps with generalized convexity. We obtain minimax theorems for set-valued maps which satisfy the introduced properties and are not continuous, by using a fixed point theorem for weakly naturally…

(lecture delivered at the Congress of the Romanian mathematicians, Brasov, June 2011) Using graph representations a new class of computable topological invariants associated with a tame real or angle valued map were recently introduced,…

Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…

It is well-known that a function on an open set in $\mathbb R^d$ is smooth if and only if it is arc-smooth, i.e., its composites with all smooth curves are smooth. In recent work, we extended this and related results (for instance, a real…

A consistent path system in a graph $G$ is an collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We say that $G$ is strictly metrizable if every…

A stable smooth map $f:N\to M$ is called "$k$-realizable" if its composition with the inclusion $M\subset M\times\Bbb R^k$ is $C^0$-approximable by smooth embeddings; and a "$k$-prem" if the same composition is $C^\infty$-approximable by…

Let $f\colon X\to Y$ be a perfect surjective map of metrizable spaces. It is shown that if $Y$ is a $C$-space (resp., $\dim Y\leq n$ and $\dim f\leq m$), then the function space $C(X,\uin^{\infty})$ (resp., $C(X,\uin^{2n+1+m})$) equipped…

A class ${\cal F}$ of graphs is called {\em tame} if there exists a constant $k$ so that every graph in ${\cal F}$ on $n$ vertices contains at most $O(n^k)$ minimal separators, {\em strongly-quasi-tame} if every graph in ${\cal F}$ on $n$…