×

zbMATH — the first resource for mathematics

Sur la stabilité des diagrammes d’applications différentiables. (French) Zbl 0354.58011

MSC:
58C25 Differentiable maps on manifolds
PDF BibTeX XML Cite
Full Text: DOI Numdam EuDML
References:
[1] N. A. BAAS , Structural Stability of Composed Mappings , Parts I-III, Preprint, The Institute for Advanced Study, Princeton, 1974 .
[2] J. P. DUFOUR , Déploiements de cascades d’application différentiables (Thèse 3e cycle, octobre 1975 , Montpellier). MR 52 #6775
[3] J. P. DUFOUR , Une limite aux extensions du théorème de préparation (C.R. Acad. Sc. Paris, t. 282, série A, 1976 , p. 199-202). MR 55 #4259 | Zbl 0315.58011 · Zbl 0315.58011
[4] J. N. MATHER , Stability of C\infty Mapping I, II, III, IV, V and VI .
[5] V. POENARU , Singularités C\infty en présence de symétrie (Lecture notes in math., Springer Verlag, n^\circ 510). MR 55 #13471 | Zbl 0325.57008 · Zbl 0325.57008 · doi:10.1007/BFb0079196
[6] F. SERGERAERT , Un théorème de fonctions implicites sur certains espaces de Fréchet et quelques applications (Ann. scient. Éc. Norm. Sup., 4e série, t. 5, 1972 , p. 599-660). Numdam | MR 54 #6182 | Zbl 0246.58006 · Zbl 0246.58006 · numdam:ASENS_1972_4_5_4_599_0 · eudml:81908
[7] J. C. TOUGERON , Stabilité des applications différentiables (Séminaire Bourbaki, n^\circ 336, 1967 , p. 1). Numdam | Zbl 0209.54901 · Zbl 0209.54901 · numdam:SB_1966-1968__10__375_0 · eudml:109738
[8] Y. H. WAN , Morse Theory for Two Functions (Topology, vol. 14, n^\circ 3, p. 218-228). MR 51 #14150 | Zbl 0305.58007 · Zbl 0305.58007 · doi:10.1016/0040-9383(75)90002-6
[9] G. WASSERMAN , Stability of Unfoldings is Space and Time (Acta Math., vol. 135, 1975 , p. 57-128). Zbl 0315.58010 · Zbl 0315.58010 · doi:10.1007/BF02392016
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.