Finite determinacy theorems are generalized to the class of C('k) maps where k (LESSTHEQ) (INFIN) is sufficiently large. For these maps, the concept of a combinatorial unfolding is defined. In the case k = (INFIN), the infinitesimal characterization of a combinatorial unfolding coincides with that of a universal unfolding. By representing a function by a polynomial in which the coefficients depend on parameters, each change of co-ordinates required in the demonstrations is obtained by variation of the coefficients in a polynomial.
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:QMM.71897 |
| Date | January 1983 |
| Creators | Selby, Alan M. |
| Publisher | McGill University |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | English |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Format | application/pdf |
| Coverage | Doctor of Philosophy (Department of Mathematics and Statistics.) |
| Rights | All items in eScholarship@McGill are protected by copyright with all rights reserved unless otherwise indicated. |
| Relation | alephsysno: 000186016, proquestno: AAINK66636, Theses scanned by UMI/ProQuest. |
Page generated in 0.0028 seconds