Dynamical and arithmetic degrees for random iterations of maps on projective space
Abstract: We show that the dynamical degree of an (i.i.d) random sequence of dominant, rational self-maps on projective space is almost surely constant. We then apply this result to height growth and height counting problems in random orbits.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.