加载中…
The problem of detecting the bifurcation set of polynomial mappings $\mathbb{ C}^m \to ^km\ge 2m\ge k\ge 1m=2k=1$ only. Its solution, which goes back to the 1970s, involves the non-constancy of the Euler characteristic of fibres. We provide a complete answer to the general case in terms of the Betti numbers of fibres and of a vanishing phenomenon discovered in the late 1990s in the real setting.

生成讲解博客的中文版本

生成AI智能校验的中文版本