We show that gradient trajectories of a denable (in an o-minimal structure) family of functions are of uniformly bounded length. We show that the length of a trajectory of the gradient of a polynomial in n variables of degree d in a ball of radius r is bounded by rA(n; d), where A(n; d) = (n)((3d 4)n1 + 2(3d 3)n2) and (n) is an explicit constant. We give explicit bounds for the length of gradient trajectories of quasipolynomials and trigonometric quasipolynomials. As an application we give a construction of curves (piecewise gradient trajectory of a polynomial) joining two points in an open connected semialgebraic set. We give an explicit bound for its length. We also obtain an explicit and quite sharp bound in Yomdin's version of qu...
AbstractWe hereby introduce and study the notion of self-contracted curves, which encompasses orbits...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...
11 pagesWe prove a quantitative version of the curve selection lemma. Denoting by $s,d,k$ a bound on...
International audienceWe study trajectories of sub-Riemannian (also called horizontal) gradient of p...
Let M ⊂ Rn be a connected component of an algebraic set ϕ−1(0) where ϕ is a polynomial of degree d. ...
International audienceWe hereby introduce and study the notion of self-contracted curves, which enco...
We show that any semi-algebraic sweeping process admits piecewise absolutely continuous solutions (...
International audienceHow many operations do we need on the average to compute an approximate root o...
This work is devoted to the study of the trajectories of gradient vector fields of functions definab...
Recibido: 17 de enero de 2005 Aceptado: 28 de abril de 2005 Let f be a C1 function defined over Rn a...
International audienceThe classical Lojasiewicz inequality and its extensions for partial differenti...
The classical Lojasiewicz inequality and its extensions for partial differential equation problems (...
AbstractWe prove sharp Lp→Lq estimates for averaging operators along general polynomial curves in tw...
We prove an analog of the Yomdin–Gromov lemma for p-adic definable sets and more broadly in a non-Ar...
Abstract. We develop the theory of discrete-time gradient flows for convex func-tions on Alexandrov ...
AbstractWe hereby introduce and study the notion of self-contracted curves, which encompasses orbits...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...
11 pagesWe prove a quantitative version of the curve selection lemma. Denoting by $s,d,k$ a bound on...
International audienceWe study trajectories of sub-Riemannian (also called horizontal) gradient of p...
Let M ⊂ Rn be a connected component of an algebraic set ϕ−1(0) where ϕ is a polynomial of degree d. ...
International audienceWe hereby introduce and study the notion of self-contracted curves, which enco...
We show that any semi-algebraic sweeping process admits piecewise absolutely continuous solutions (...
International audienceHow many operations do we need on the average to compute an approximate root o...
This work is devoted to the study of the trajectories of gradient vector fields of functions definab...
Recibido: 17 de enero de 2005 Aceptado: 28 de abril de 2005 Let f be a C1 function defined over Rn a...
International audienceThe classical Lojasiewicz inequality and its extensions for partial differenti...
The classical Lojasiewicz inequality and its extensions for partial differential equation problems (...
AbstractWe prove sharp Lp→Lq estimates for averaging operators along general polynomial curves in tw...
We prove an analog of the Yomdin–Gromov lemma for p-adic definable sets and more broadly in a non-Ar...
Abstract. We develop the theory of discrete-time gradient flows for convex func-tions on Alexandrov ...
AbstractWe hereby introduce and study the notion of self-contracted curves, which encompasses orbits...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...
11 pagesWe prove a quantitative version of the curve selection lemma. Denoting by $s,d,k$ a bound on...