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

A fundamental result in structural graph theory states that every graph with large average degree contains a large complete graph as a minor. We prove this result with the extra property that the minor is small with respect to the order of…

Consider a definable complete d-minimal expansion $(F, <, +, \cdot, 0, 1, \dots,)$ of an oredered field $F$. Let $X$ be a definably compact definably normal definable $C^r$ manifold and $2 \le r <\infty$. We prove that the set of definable…

The paper deals with Henselian valued field with analytic structure. Actually, we are focused on separated analytic structures, but the results remain valid for strictly convergent analytic ones as well. A classical example of the latter is…

A minimal separator in a graph is an inclusion-minimal set of vertices that separates some fixed pair of nonadjacent vertices. A graph class is said to be tame if there exists a polynomial upper bound for the number of minimal separators of…

We show that for a given initial point the typical, in the sense of Baire category, nonexpansive compact valued mapping $F$ has the following properties: there is a unique sequence of successive approximations and this sequence converges to…

We consider classes of arbitrary (finite or infinite) graphs of bounded shrub-depth, specifically the classes $\mathrm{TM}_r(d)$ of arbitrary graphs that have tree models of height $d$ and $r$ labels. We show that the graphs of…

Let p be a polynomial in one complex variable. Smale's mean value conjecture estimates |p'(z)| in terms of the gradient of a chord from (z, p(z)) to some stationary point on the graph of $p$. The conjecture does not immediately generalise…

We consider a semi-algebraic function defined on a closed semi-algebraic set X. We give formulas relating the topology of X to the indices of the critical points of the function and to the topological behavior of the function at infinity.…

Let $\gamma(G)$ denote the domination number of a graph $G$. A vertex $v\in V(G)$ is called a \emph{critical vertex} of $G$ if $\gamma(G-v)=\gamma(G)-1$. A graph is called \emph{vertex-critical} if every vertex of it is critical. In this…

The purpose of the present paper is to give an effective version of the noncritical $p$-tame Belyi theorem. That is to say, we compute explicitly an upper bound of the minimal degree of tamely ramified Belyi maps in positive characteristic…

For a connected graph $G$ with order $n$, let $e(G)$ be the number of its distinct eigenvalues and $d$ be the diameter. We denote by $m_G(\mu)$ the eigenvalue multiplicity of $\mu$ in $G$. It is well known that $e(G)\geq d+1$, which shows…

Criticality is a fundamental notion in graph theory that has been studied continually since its introduction in the early 50s by Dirac. A graph is called $k$-vertex-critical ($k$-edge-critical) if it is $k$-chromatic but removing any vertex…

The postcritical set $P(f)$ of a rational map $f:\mathbb P^1\to \mathbb P^1$ is the smallest forward invariant subset of $\mathbb P^1$ that contains the critical values of $f$. In this paper we show that every finite set $X\subset \mathbb…

Let $n, m, k$ be positive integers with $k=n-m+1$. We establish an abstract Morse-Sard-type theorem which allows us to deduce, on the one hand, a previous result of De Pascale's for Sobolev $W^{k,p}_{\textrm{loc}}(\mathbb{R}^n,…

We prove that if $X$ is a paracompact space, $Y$ is a metric space and $f:X\to Y$ is a functionally fragmented map, then (i) $f$ is $\sigma$-discrete and functionally $F_\sigma$-measurable; (ii) $f$ is a Baire-one function, if $Y$ is weak…

Let $f$ be a postcritically finite rational map. We prove that, as $n$ large enough, there exists an $f^n$-invariant (finite connected) graph on $\widehat{\mathbb{C}}$ such that it contains the postcritical set of $f$.

We show that the space of continuous functions over a compact space X admits an equivalent pointwise-lowersemicontinuous locally uniformly rotund norm whenever X admits a fully closed map onto a compact Y such that C(Y) and the spaces of…

Letting $P$ be a convex polytope in $\mathbb{R}^d$ with $n>d$ vertices, we study geometric and analytical properties of the set of generalized barycentric coordinates relative to any point $p\in P$. We prove that such sets are polytopes in…

Consider the (formal/analytic/algebraic) map-germs Maps(X,(k^p,o)). Let G be the group of right/contact/left-right transformations. I extend the following (classical) results from the real/complex-analytic case to the case of arbitrary…

A set of vertices S is a resolving set of a graph G; if for every pair of vertices x and y in G, there exists a vertex s in S such that x and y differ in distance to s. A smallest resolving set of G is called a metric basis. The metric…