Permutations encoding the local shape of level curves of real polynomials via generic projections (Q2675335)

The author proves that, if the chosen projection avoids the bitangents and the inflections to the small enough level curves of a real bivariate polynomial function near a strict local minimum at the origin, then the asymptotic Poincaré-Reeb tree becomes complete binary and its vertices become totally ordered. This projection direction is called generic. She proves that for any such asymptotic family of level curves, there are finitely many intervals on the real projective line outside of which all the directions are generic with respect to all the curves in the family. If the projection is generic, then the local shape of the curves can be encoded in terms of alternating permutations, called snakes. Snakes offer an effective description of the local geometry and topology, well-suited for computations.