Related papers: On a Nash curve selection lemma through finitely m…
A theorem of Functorial Affinization of Nash's manifold is proven here giving necessary and sufficient conditions to lift a holomorphic arc to the smooth locus of the Nash manifold. In addition a theorem about valuations is proven.
We prove that, for any closed semialgebraic subset $W$ of $\mathbb{R}^n$ and for any positive integer $p$, there exists a Nash function $f:\mathbb{R}^n\setminus W\longrightarrow (0, \infty)$ which is equivalent to the distance function from…
We show that a linear functional equation with polynomial coefficients need not admit an arc-analytic solution even if it admits a continuous semialgebraic one. We also show that such an equation need not admit a Nash regulous solution even…
An \emph{s-graph} is a graph with two kinds of edges: \emph{subdivisible} edges and \emph{real} edges. A \emph{realisation} of an s-graph $B$ is any graph obtained by subdividing subdivisible edges of $B$ into paths of arbitrary length (at…
This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in…
The algebraic approach to the Constraint Satisfaction Problem (CSP) uses high order symmetries of relational structures -- polymorphisms -- to study the complexity of the CSP. In this paper we further develop one of the methods the…
We provide an account for the existence and uniqueness of solutions to rough differential equations under the framework of controlled rough paths. The case when the driving path is $\beta$-H\"older continuous, for $\beta>1/3$, is widely…
The classical Steinitz theorem asserts that if the origin lies within the interior of the convex hull of a set $S \subset \mathbb{R}^d$, then there are at most $2d$ points in $S$ whose convex hull contains the origin within its interior.…
In this paper we study the existence and uniqueness of Nash equilibria (solution to competition-wise problems, with several controls trying to reach possibly different goals) associated to linear partial differential equations and show…
We first generalize a curve selection lemma for Noetherian schemes and apply it to prove a version of Curve Selection Lemma in arc spaces, answering affirmatively a question by Reguera. Furthermore, thanks to a structure theorem of…
Let P be a polygonal curve in R^d of length n, and S be a point-set of size k. We consider the problem of finding a polygonal curve Q on S such that all points in S are visited and the Fr\'echet distance from $P$ is less than a given…
In this short note we give some corollaries of the polynomial inverse function theorem for large fields. We prove inverse and implicit function theorems for Nash maps over large fields, characterize large fields as fields satisfying inverse…
We prove that every 2k-edge-connected graph with countably many edge-ends admits a k-arc-connected orientation, extending the previous result by Assem, Koloschin and Pitz that also assumed the hypothesis of the graph being locally finite.…
Nash-Williams proved in 1960 that a finite graph admits a $k$-arc-connected orientation if and only if it is $2k$-edge-connected, and conjectured that the same result should hold for all infinite graphs, too. Progress on Nash-Williams's…
Let ${\mathfrak M}=({\mathcal M},\rho)$ be a metric space and let $X$ be a Banach space. Let $F$ be a set-valued mapping from ${\mathcal M}$ into the family ${\mathcal K}_m(X)$ of all compact convex subsets of $X$ of dimension at most $m$.…
A generalized Nash equilibrium problem (GNEP) in Banach space consists of $N>1$ optimal control problems with couplings in both the objective functions and, most importantly, in the feasible sets. We address the existence of equilibria for…
Many algorithms for determining properties of real algebraic or semi-algebraic sets rely upon the ability to compute smooth points. Existing methods to compute smooth points on semi-algebraic sets use symbolic quantifier elimination tools.…
We survey the proof of the Nash conjecture for surfaces and show how geometric and topological ideas developed in previous articles by the authors influenced it. Later we summarize the main ideas in the higher dimensional statement and…
The Kohayakawa-Nagle-R\"odl-Schacht conjecture roughly states that every sufficiently large locally $d$-dense graph $G$ on $n$ vertices must contain at least $(1-o(1))d^{|E(H)|}n^{|V(H)|}$ copies of a fixed graph $H$. Despite its important…