PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
August 20, 20240 citationsOpen Access

Hurwitz existence problem and fiber products

View Full Paper
FPFedor Pakovich

Key Points

  • The study addresses the relationship between the genus, degree, and branching points of holomorphic maps between Riemann surfaces.
  • Key evidence reveals that many known branch data cannot be realized, expanding the understanding of non-realizable combinations.
  • Analysis of fiber products facilitates a deeper comprehension of the Hurwitz existence problem in mapping Riemann surfaces together effectively and consistently.  *This foundation allows for constructing new forms of non-realizable data as well.  *Halphen's theorem regarding polynomial solutions links historical and modern mathematical concepts.

Abstract

With each holomorphic map f: R C P¹ between compact Riemann surfaces one can associate a combinatorial datum consisting of the genus g of R, the degree n of f, the number q of branching points of f, and the q partitions of n given by the local degrees of f at the preimages of the branching points. These quantities are related by the Riemann-Hurwitz formula, and the Hurwitz existence problem asks whether a combinatorial datum that fits this formula actually corresponds to some f. In this paper, using results and techniques related to fiber products of holomorphic maps between compact Riemann surfaces, we prove a number of results that enable us to uniformly explain the non-realizability of many previously known non-realizable branch data, and to construct a large amount of new such data. We also deduce from our results the theorem of Halphen, proven in 1880, concerning polynomial solutions of the equation A (z) ᵃ+B (z) ᵇ=C (z) ᶜ, where a, b, c are integers greater than one.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Fedor Pakovich (2024) studied this question.

synapsesocial.com/papers/68e5bb23b6db64358755310chttps://doi.org/10.48550/arxiv.2408.10874
Ask AI
Helpful
Bookmark
Share
View Full Paper