pith. sign in

arxiv: math/0703502 · v2 · submitted 2007-03-16 · 🧮 math.NT · math.AG

Sur la conjecture abc, version corps de fonctions d'Oesterle

classification 🧮 math.NT math.AG
keywords conjectureconstantdegreeleastnumberoesterleversionasserts
0
0 comments X
read the original abstract

We show a weak form of the function field version of Oesterle's abc conjecture. It asserts that, if $B$ is a complex projective connected curve, the number of intersection points, counted without multiplicities, of a fixed divisor $D$ of degree $d>0$ over $B$ with the graph $H$ of a section $h:B\to B\times \bP^1$ to the first projection is at least $(d-2)n-C(B,D)$, where $n$ is the degree of $H$ over $\bP^1$, and $C(D,B)$ a constant depending only on these two data. We show this number is at least $(d-2[\sqrt {d}]).n-C(D,B)$. The constant is ineffective.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.