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

We consider a global semianalytic set defined by real analytic functions definable in an o-minimal structure. When the o-minimal structure is polynomially bounded, we show that the closure of this set is a global semianalytic set defined by…

In this paper we review the definition of the invariants "bar codes" and "Jordan cells" of real and angle valued tame maps as proposed in Burghelea and Dey and Carlsson et al and prove the homotopy invariance of the sum # B^c_r +#B^o_{r-1}$…

Let $G=(V,E)$ be a graph. An ordering of $G$ is a bijection $\alpha: V\dom \{1,2,..., |V|\}.$ For a vertex $v$ in $G$, its closed neighborhood is $N[v]=\{u\in V: uv\in E\}\cup \{v\}.$ The profile of an ordering $\alpha$ of $G$ is…

An ordered graph is a simple graph with an ordering on its vertices. Define the ordered path $P_n$ to be the monotone increasing path with $n$ edges. The ordered size Ramsey number $\tilde{r}(P_r,P_s)$ is the minimum number $m$ for which…

The Sard theorem from 1942 requires that a mapping $f:\mathbb{R}^n \to \mathbb{R}^m$ is of class $C^k$, $k > \max (n-m,0)$. In 1957 Duvovitski\u{\i} generalized Sard's theorem to the case of $C^k$ mappings for all $k$. Namely he proved…

We introduce an operator $\mathbf{S}$ on vector-valued maps $u$ which has the ability to capture the relevant topological information carried by $u$. In particular, this operator is defined on maps that take values in a closed submanifold…

Let $f:{\mathbb P}^n\to{\mathbb P}^n$ be a morphism of degree $d\ge2$. The map $f$ is said to be post-critically finite (PCF) if there exist integers $k\ge1$ and $\ell\ge0$ such that the critical locus $\operatorname{Crit}_f$ satisfies…

This paper concerns analytic free maps. These maps are free analogs of classical analytic functions in several complex variables, and are defined in terms of non-commuting variables amongst which there are no relations - they are free…

Let $E,F$ be two topological spaces and $u:E\rightarrow F$ be a map. \ If $F$ is Haudorff and $u$ is continuous, then its graph is closed. \ \ The Closed Graph Theorem establishes the converse when $E$ and $F$ are suitable objects of…

A $1$-factorization of a graph $G$ is a collection of edge-disjoint perfect matchings whose union is $E(G)$. A trivial necessary condition for $G$ to admit a $1$-factorization is that $|V(G)|$ is even and $G$ is regular; the converse is…

A generalization of the classical Sard theorem in the plane is the following. Let $f$ be a function defined on a subset $A\subset{\mathbb R}^2$. If $f$ has modulus of continuity $\omega(r)\lesssim r^2$, then $f(A)\subset{\mathbb R}$ has…

Let K be an algebraically closed field endowed with a complete non-archimedean norm with valuation ring R. Let f:Y -> X be a map of K-affinoid varieties. In this paper we study the analytic structure of the image f(Y) in X; such an image is…

We present a definable smooth version of the Thom transversality theorem. We show further that the set of non-transverse definable smooth maps is nowhere dense in the definable smooth topology. Finally, we prove a definable version of a…

Fractal geometry deals mainly with irregularity and captures the complexity of a structure or phenomenon. In this article, we focus on the approximation of set-valued functions using modern machinery on the subject of fractal geometry. We…

A connected graph $G$ with at least $2m+2n+2$ vertices is said to have property $E(m,n)$ if, for any two disjoint matchings $M$ and $N$ of size $m$ and $n$ respectively, $G$ has a perfect matching $F$ such that $M\subseteq F$ and $N\cap…

We study how small is the set of critical values of the distance function from a compact (resp. closed) set in the plane or in a connected complete two-dimensional Riemannian manifold. We show that for a compact set, the set of critical…

For a finite collection of graphs ${\cal F}$, the ${\cal F}$-M-DELETION problem consists in, given a graph $G$ and an integer $k$, deciding whether there exists $S \subseteq V(G)$ with $|S| \leq k$ such that $G \setminus S$ does not contain…

In this paper we extend certain central results of zero dimensional systems to higher dimensions. The first main result shows that if (Y,f) is a finitely presented system, then there exists a Smale space (X,F) and a u-resolving factor map…

We consider badly approximable numbers in the case of dyadic diophantine approximation. For the unit circle $\mathbb{S}$ and the smallest distance to an integer $\|\cdot\|$ we give elementary proofs that the set $F(c) = \{x \in \mathbb{S}:…

A $K_r$-factor of a graph $G$ is a collection of vertex-disjoint $r$-cliques covering $V(G)$. We prove the following algorithmic version of the classical Hajnal--Szemer\'edi Theorem in graph theory, when $r$ is considered as a constant.…