Related papers: A Sard theorem for Tame Set-Valued mappings

A visceral structure on M is given by a definable base for a uniform topology on its universe in which all basic open sets are infinite and any infinite definable subset X of M has non-empty interior. This context includes o-minimal ordered…

For a finite simple graph $G$, say $G$ is of dimension $n$, and write $\dim(G) = n$, if $n$ is the smallest integer such that $G$ can be represented as a unit-distance graph in $\mathbb{R}^n$. Define $G$ to be \emph{dimension-critical} if…

A random rooted graph is said to be sofic if it is the Benjamini-Schramm limit of a sequence of finite graphs. Given any finite graph $H$, we prove that every one-ended, unimodular random rooted graph that does not have H as a minor must be…

If $R$ is a real analytic set in $\C^n$ (viewed as $\R^{2n}$), then for any point $p\in R$ there is a uniquely defined germ $X_p$ of the smallest complex analytic variety which contains $R_p$, the germ of $R$ at $p$. It is shown that if $R$…

We consider convex maps f:R^n -> R^n that are monotone (i.e., that preserve the product ordering of R^n), and nonexpansive for the sup-norm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the…

We give several versions of local and global inverse mapping theorem for tame non necessarily smooth, mappings. Here tame mapping means a mapping which is subanalytic or, more generally, definable in some o-minimal structure. Our sufficient…

We give an 'arithmetic regularity lemma' for groups definable in finite fields, analogous to Tao's 'algebraic regularity lemma' for graphs definable in finite fields. More specifically, we show that, for any $M>0$, any finite field…

A polynomial $f$ of degree $d$ and coefficients in an algebraically closed field $k$ defines a morphism $f:\mathbb{P}^1_k\longrightarrow\mathbb{P}^1_k$ which, if char$(k)\nmid d$, is unramified outside a finite set of points in the image:…

It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…

An $n$ dimensional minimal submanifold $\Sigma$ of $\R^{n+m}$ is called non-parametric if $\Sigma$ can be represented as the graph of a vector-valued function $f:D\subset \R^n \mapsto \R^m$. This note provides a sufficient condition for the…

A graph $G$ is $k$-critical if it has chromatic number $k$, but every proper subgraph of $G$ is $(k-1)$--colorable. Let $f_k(n)$ denote the minimum number of edges in an $n$-vertex $k$-critical graph. We give a lower bound, $f_k(n) \geq…

In this paper we present a new class of complexity measures, induced by a new data structure for representing $k$-valued functions (operations), called minor decision diagram. The results are presented in terms of Multi-Valued Logic…

We give an example of a dense o-minimal structure in which there is a definable quotient that cannot be eliminated, even after naming parameters. Equivalently, there is an interpretable set which cannot be put in parametrically definable…

A near-factor of a finite simple graph $G$ is a matching that saturates all vertices except one. A graph $G$ is said to be near-factor-critical if the deletion of any vertex from $G$ results in a subgraph that has a near-factor. We prove…

In a previous paper of one of us [Europhys. Lett. 59 (2002), 330--336] the validity of Greene's method for determining the critical constant of the standard map (SM) was questioned on the basis of some numerical findings. Here we come back…

In this paper we work in o-minimal structures with definable Skolem functions and show that a continuous definable map between Hausdorff locally definably compact definable spaces is definably proper if and only if it is proper morphism in…

Let $\mathbf{f} = \left(f_1, \dots, f_p\right) $ be a polynomial tuple in $\mathbb{Q}[z_1, \dots, z_n]$ and let $d = \max_{1 \leq i \leq p} \deg f_i$. We consider the problem of computing the set of asymptotic critical values of the…

Given a number field K, we consider families of critically separable rational maps of degree d over K possessing a certain fixed-point and multiplier structure. With suitable notions of isomorphism and good reduction between rational maps…

In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…

Let $F=(F_1, F_2, ..., F_m): \mathbb{C}^n \to \mathbb{C}^m$ be a polynomial dominant mapping with $n>m$. In this paper we give the relations between the bifurcation set of $F$ and the set of values where $F$ is not M-tame as well as the set…