Constructing separable Arnold snakes of Morse polynomials (Q2025699)

In general, any snake can be associated with Morse polynomials in one variable, and the number of snakes is equal to the number of topologically nonequivalent Morse polynomials (see [\textit{V. I. Arnol'd}, Russ. Math. Surv. 47, No. 1, 1 (1992; Zbl 0791.05001); translation from Usp. Mat. Nauk 47, No. 1, 3--45 (1992)]). The author considers snakes associated with alternating permutations, given by the relative positions of critical values of a Morse polynomial (cf. [\textit{S. K. Lando}, Lectures on generating functions. Transl. from the Russian by the author. Providence, RI: American Mathematical Society (AMS) (2003; Zbl 1032.05001)]), and calls them Arnold snakes. Then using the notion of separable permutation (see [\textit{P. Bose} et al., Inf. Process. Lett. 65, No. 5, 277--283 (1998; Zbl 1338.68304); \textit{S. Kitaev}, Patterns in permutations and words. Berlin: Springer (2011; Zbl 1257.68007)]) and some other combinatorial objects and considerations, she shows how to construct explicitly polynomials in one variable with preassigned critical values configurations for a special class of Arnold snakes associated with separable permutations. The author emphasizes also that the paper is based on the first chapter of her PhD thesis [The shapes of level curves of real polynomials near strict local minima. Université de Lille (2018), \url{https://hal.archives-ouvertes.fr/tel-01909028v1}], defended at Paul Painlevé Laboratory in Lille.