2023 TAMING GENUS 0 (OR 1) COMPONENTS ON VARIABLES-SEPARATED EQUATIONS
Michael D. Fried
Author Affiliations +
Albanian J. Math. 17(2): 19-80 (2023). DOI: 10.51286/albjm/1685536799

Abstract

To describe curves of form Cf,g=def(x,y)|f(x)g(y)=0 and their number theory properties, you must address Cf,g whose projective normalization has a genus 0 (or 1) component. For f and g polynomials and f indecomposable, [Fr73a] distinguished Cf,g with u=1 versus u>1 components (Schinzel’s problem). For u=1, [Fr73b, (1.6) of Prop. 1] gave a direct genus formula. To complete u>1 required an adhoc genus computation.

[Fr12] revisited later work. Pakovich [Pak18b], an example, dropped the indecomposable and polynomial restrictions, but added Cf,g is irreducible (u=1). He showed – for fixed f – unless the Galois closure of the cover for f has genus 0 (or 1), the genus grows linearly in deg(g). Cor. 2.20 and Cor. 2.21 extend [Fr73b, Prop. 1] and use Nielsen classes to generalize Pakovich’s formulation for u>1.

Using the solution to the Davenport and Schinzel problems, Hurwitz families track the significance of these components, an approach motivated by Riemann’s relating θ functions and half-canonical classes.

Citation

Download Citation

Michael D. Fried. "TAMING GENUS 0 (OR 1) COMPONENTS ON VARIABLES-SEPARATED EQUATIONS." Albanian J. Math. 17 (2) 19 - 80, 2023. https://doi.org/10.51286/albjm/1685536799

Information

Published: 2023
First available in Project Euclid: 11 July 2023

MathSciNet: MR4613608
Digital Object Identifier: 10.51286/albjm/1685536799

Subjects:
Primary: 12F10 , 14D22 , 20B15 , 30F10
Secondary: 12D05 , 12E30 , 20E22

Keywords: Davenport’s Problem , factorization of variables separated polynomials , genus 0 groups , imprimitive groups , Nielsen classes , Pakovich’s Theorem , Riemann’s Existence Theorem , Schinzel’s Problem

Rights: Copyright © 2023 Research Institute of Science and Technology (RISAT)

JOURNAL ARTICLE
62 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.17 • No. 2 • 2023
Back to Top