Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the n-matings of polynomials (2310.04713v2)

Published 7 Oct 2023 in math.DS

Abstract: We introduce the notion of n-mating in this work, which includes the classical mating of polynomials as a special case. The new notion brings further links between the polynomial world and the rational world than the classical one, as well as a natural classification of rational maps according to their n-unmatability. We classify the hyperbolic 2-matings according to the (non-)existence of orientation-reversing equators for them. For rational maps admitting orientation-reversing equators, we describe their dynamics via matings of half polynomials. There are diverse types of n-matings from the bicritical family and the degree-2 capture family exhibited in our explorations, which demonstrates the ubiquity of them. Finally we consider the postcritical realization programme of rational maps (among the atomic and mating family respectively). The compositive trick is exploited to deal with problems in the programme.

Summary

We haven't generated a summary for this paper yet.