Suite aux travaux de Zbigniew Szafraniec et Nicolas Dutertre, je me suis intéressée aux calculs de caractéristiques d'Euler de certains espaces semi-algébriques. En particulier, ceux de laforme : $ {(-1)^{varepsilon_1} G_1geq 0 }cap...cap{(-1)^{varepsilon_l} G_lgeq 0}cap W$, où $epsilon=(epsilon_1,...,epsilon_l)in{0,1}^l$, $G=(G_1,...,G_l):R^nrightarrowR^l$ polynomiale et $W:=F^{-1}(0)subsetR^n$ où $F:R^nrightarrowR^k$ et $k+lleq n$. Une fois le cas lisse traité, on intersecte ces ensembles avec ${ fgeq 0}$ ou ${ fleq 0}$, où $f$ est polynomiale telle que $f^{-1}(0)$ admette un nombre fini de singularités. J'énonce alors un théorème reliant ces caractéristiques au degré d'applications faisant intervenir les fonctions $f$, $F$ et $G$. Pour finir, on s'intéresse au cas où l'ensemble $W$ possède un lieu critique compact.Dans une autre partie, je travaille sur l'indice radial, indice défini sur des variétés singulières. J'énonce un résultat faisant le lien entre l'indice radial d'un champ de vecteurs V en une singularité avec l'indice radial de son opposé -V. Finalement, je relie l'indice radial à un indice d'intersection. / After the works of Zbigniew Szafraniec and Nicolas Dutertre, we are interested in computing Euler characteristics of some particular semialgebraic sets. In particular, the ones of the form : $ {(-1)^{varepsilon_1} G_1geq 0 }cap...cap{(-1)^{varepsilon_l} G_lgeq 0}cap W$, where $varepsilon=(varepsilon_1,...,varepsilon_l)in{0,1}^l$, $G=(G_1,...,G_l):R^nrightarrowR^l$ polynomial and $W:=F^{-1}(0)subsetR^n$ where $F:R^nrightarrowR^k$ and $k+lleq n$. Once the smooth case is treated, we intersect these sets with ${ fgeq 0}$ or ${ fleq 0}$, where $f$ is polynomial such that $f^{-1}(0)$ contains a finite number of singularities. Then we state a theorem that makes a link between these caracteristics and some degrees of mappings involving the functions $f$, $F$ and $G$. Finally, we study the case where $W$ has a compact singular set.In another part, I work with the radial index, an index defined for singular manifolds. I have a result making a link between the radial index of a vector field V and its opposite -V at a singularity. Finally, I relate that radial index to an intersection index.

Ce mémoire présente une nouvelle méthode d’étudier des fonctions de Morse sur une variété compacte. Plus précisément, les croisements entre les lignes de flot de pseudo-gradients associés à des fonctions de Morse permettent de définir géométriquement des morphismes entre les complexes de Morse, morphismes qui ne peuvent généralement pas être obtenus par une homotopie. Cette nouvelle classe de morphismes mène à la définition d’une catégorie triangulée. La question centrale est de savoir si tout objet de cette catégorie est décomposable en cône itéré de fonctions de Morse parfaites. En effet, une telle décomposition simplifierait l’étude de la dynamique d’une fonction de Morse en l’interprétant plutôt comme plusieurs fonctions parfaites. Une seconde question d’importance porte sur une condition de généricité globale à laquelle est soumise cette catégorie triangulée. Nous étudions la possibilité de s’en soustraire en proposant une méthode de déformations des fonctions de Morse. / This master’s thesis introduces a new way to sudy Morse functions on a compact manifold. More specifically, crossings between flows of pseudo-gradients associated to Morse functions allow one to define geometric realisations of morphisms between the Morse complexes. This new class of morphisms leads to the definition of a triangulated category. The main question is to determine if every object of this category admits an iterated cone decomposition. Such a decomposition would greatly simplify the study of the dynamic of a Morse function by interpreting it as many perfect Morse functions. A second topic concerns the global genericity condition to which this category is subject. We study a way, through deformation of Morse functions, to avoid such a constraint.

[pt] A teoria de Morse relaciona a topologia de um espaço aos elementos críticos de uma função escalar definida nele. Isso vale tanto para a teoria clássica quanto para a versão discreta proposta por Forman em 1995. Essas teorias de Morse permitem caracterizar a topologia do espaço a partir de funções definidas nele, mas também permite estudar funções a partir de construções tipológicas derivadas dela, como por exemplo o complexo de Morse-Smale. Apesar da teoria de Morse discreta se aplicar para complexos celulares gerais de forma inteiramente combinatória, o que torna a teoria particularmente bem adaptada para o computador, as funções usadas na teoria não são amostragens de funções contínuas, mas casamentos especiais no grafo que codifica as adjacências no complexo celular, chamadas de casamentos de Morse. Quando usar essa teoria para estudar um espaço topológico, procura- se casamentos de Morse ótimos, i.e. com o menor número possível de elementos críticos, para obter uma informação topológica do complexo sem redundância. Na primeira parte desta tese, investiga-se a complexidade parametrizada de encontrar esses casamentos de Morse ótimos. Por um lado, prova-se que o problema ERASABILITY, um problema fortemente relacionado à encontrar casamentos de Morse ótimos, é W [P ]-completo. Por outro lado, um algoritmo é proposto para calcular casamentos de Morse ótimos em triangulações de 3-variedades, que é FPT no parâmetro do tree- width de seu grafo dual. Quando usar a teoria de Morse discreta para estudar uma função escalar definida no espaço, procura-se casamentos de Morse que capturam a informação geométrica dessa função. Na segunda parte é proposto uma construção de casamentos de Morse baseada em casamentos estáveis. As garantias teóricas sobre a relação desses casamentos com a geometria são elaboradas a partir de provas surpreendentemente simples que aproveitam da caracterização local do casamento estável. A construção e as suas garantias funcionam em qualquer dimensão. Finalmente, resultados mais fortes são obtidos quando a função for suave discreta, uma noção definida nesta tese. / [en] Morse theory relates the topology of a space to the critical elements of a scalar function defined on it. This applies in both the classical theory and a discrete version of it defined by Forman in 1995. Those Morse theories permit to characterize a topological space from functions defined on it, but also to study functions based on topological constructions it implies, such as the Morse-Smale complex. While discrete Morse theory applies on general cell complexes in an entirely combinatorial manner, which makes it suitable for computation, the functions it considers are not sampling of continuous functions, but special matchings in the graph encoding the cell complex adjacencies, called Morse matchings. When using this theory to study a topological space, one looks for optimal Morse matchings, i.e. one with the smallest number of critical elements, to get highly succinct topological information about the complex. The first part of this thesis investigates the parameterized complexity of finding such optimal Morse matching. On the one hand the Erasability problem, a closely related problem to finding optimal Morse matchings, is proven to be W[P]-complete. On the other hand, an algorithm is proposed for computing optimal Morse matchings on triangulations of 3-manifolds which is fixed parameter tractable in the tree-width of its dual graph. When using discrete Morse theory to study a scalar function defined on the space, one looks for a Morse matching that captures the geometric information of that function. The second part of this thesis introduces a construction of Morse matchings based on stable matchings. The theoretical guarantees about the relation of such matchings to the geometry are established through surprisingly simple proofs that benefits from the local characterization of the stable matching. The construction and its guarantees work in any dimension. Finally stronger results are obtained if the function is discrete smooth on the complex, a notion defined in this thesis.

No description available.

No description available.