Proof of First Result

• Let C denote the field of all complex numbers. • A polynomial mapping α: Cn → Cn is called a poly-nomial automorphism if: – this mapping a bijection, and – the inverse mapping β = α−1 is also polynomial. • A polynomial mapping ϕ: Ck → Cn is called rectifi-able if: – these exists a polynomial automorphism α: Cn → Cn – for which α(ϕ(t1,..., tk)) = (t1,..., tk, 0,...) for all (t1,..., tk). • Most existing proofs of rectifiability just prove the ex-istence of a rectifying automorphism α. • In this talk, we show how to compute α. Formulation of the..