Papers › Dynamical Systems of Correspondences on the Projective Line II: Degrees of Multiplier Maps
Dynamical Systems of Correspondences on the Projective Line II: Degrees of Multiplier Maps
Rin Gotou
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper is a sequel of arXiv:2109.06394. In this paper, we consider a kind of inverse problem of multipliers. The problem is to count number of isospectral correspondences, correspondences which has the same combination of multipliers. We give a primitive explicit upper bound. In particular, for a generic rational map of degree d, there are at most O(d¹⁰ᵈ) rational maps with the same combination of multipliers for the fixed points and the 3-periodic points. This paper also includes two proofs of a correction in the errata of a Hutz-Tepper's result, which states that the multipliers of the fixed and 2-periodic points determines generic cubic morphism uniquely. One is done by proceeding the computation in Hutz-Tepper's proof. The other is done by more explicit computation with the help of invariant theory.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections