English

Sparsity of postcritically finite maps of $\mathbb{P}^k$ and beyond: A complex analytic approach

Dynamical Systems 2025-12-22 v2 Complex Variables Number Theory

Abstract

An endomorphism f:PkPkf:\mathbb{P}^k\to\mathbb{P}^k of degree d2d\geq2 is said to be postcritically finite (or PCF) if its critical set Crit(f)\mathrm{Crit}(f) is preperiodic, i.e. if there are integers m>n0m>n\geq0 such that fm(Crit(f))fn(Crit(f))f^m(\mathrm{Crit}(f))\subseteq f^n(\mathrm{Crit}(f)). When k2k\geq2, it was conjectured by Ingram, Ramadas and Silverman that, in the space Enddk\mathrm{End}_d^k of all endomorphisms of degree dd of Pk\mathbb{P}^k, such endomorphisms are not Zariski dense. We prove this conjecture. Further, in the space Polyd2\mathrm{Poly}_d^2 of all regular polynomial endomorphisms of degree d2d\geq2 of the affine plane A2\mathbb{A}^2, we construct a dense and Zariski open subset where we have a uniform bound on the number of preperiodic points lying in the critical set. The proofs are a combination of the theory of heights in arithmetic dynamics and methods from real dynamics to produce open subsets with maximal bifurcation.

Keywords

Cite

@article{arxiv.2305.02246,
  title  = {Sparsity of postcritically finite maps of $\mathbb{P}^k$ and beyond: A complex analytic approach},
  author = {Thomas Gauthier and Johan Taflin and Gabriel Vigny},
  journal= {arXiv preprint arXiv:2305.02246},
  year   = {2025}
}

Comments

108 pages, 2 figures. Final version. To appear in Publications Math IHES