Superelliptic curve explained

In mathematics, a superelliptic curve is an algebraic curve defined by an equation of the form

ym=f(x),

where

m\geq2

is an integer and f is a polynomial of degree

d\geq3

with coefficients in a field

k

; more precisely, it is the smooth projective curve whose function field defined by this equation.The case

m=2

and

d=3

is an elliptic curve, the case

m=2

and

d\ge5

is a hyperelliptic curve, and the case

m=3

and

d\geq4

is an example of a trigonal curve.

Some authors impose additional restrictions, for example, that the integer

m

should not be divisible by the characteristic of

k

, that the polynomial

f

should be square free, that the integers m and d should be coprime, or some combination of these.[1]

The Diophantine problem of finding integer points on a superelliptic curve can be solved by a method similar to one used for the resolution of hyperelliptic equations: a Siegel identity is used to reduce to a Thue equation.

Definition

More generally, a superelliptic curve is a cyclic branched covering

C\toP1

of the projective line of degree

m\geq2

coprime to the characteristic of the field of definition. The degree

m

of the covering map is also referred to as the degree of the curve. By cyclic covering we mean that the Galois group of the covering (i.e., the corresponding function field extension) is cyclic.

The fundamental theorem of Kummer theory implies that a superelliptic curve of degree

m

defined over a field

k

has an affine model given by an equation

ym=f(x)

for some polynomial

f\ink[x]

of degree

m

with each root having order

<m

, provided that

C

has a point defined over

k

, that is, if the set

C(k)

of

k

-rational points of

C

is not empty. For example, this is always the case when

k

is algebraically closed. In particular, function field extension

k(C)/k(x)

is a Kummer extension.

Ramification

Let

C:ym=f(x)

be a superelliptic curve defined over an algebraically closed field

k

, and

B'\subsetk

denote the set of roots of

f

in

k

. Define setB = \beginB' &\textm\text\deg(f), \\B'\cup\ &\text\endThen

B\subsetP1(k)

is the set of branch points of the covering map

C\toP1

given by

x

.

For an affine branch point

\alpha\inB

, let

r\alpha

denote the order of

\alpha

as a root of

f

. As before, we assume that

1\leqr\alpha<m

. Thene_\alpha = \fracis the ramification index

e(P\alpha,)

at each of the

(m,r\alpha)

ramification points

P\alpha,

of the curve lying over

\alpha\inA1(k)\subsetP1(k)

(that is actually true for any

\alpha\ink

).

For the point at infinity, define integer

0\leqrinfty<m

as follows. If s = \min \,then

rinfty=ms-\deg(f)

. Note that

(m,rinfty)=(m,\deg(f))

. Then analogously to the other ramification points,e_\infty = \fracis the ramification index

e(Pinfty,)

at the

(m,rinfty)

points

Pinfty,

that lie over

infty

. In particular, the curve is unramified over infinity if and only if its degree

m

divides

\deg(f)

.

Curve

C

defined as above is connected precisely when

m

and

r\alpha

are relatively prime (not necessarily pairwise), which is assumed to be the case.

Genus

By the Riemann-Hurwitz formula, the genus of a superelliptic curve is given by

g=

12
\left(

m(|B|-2)-\sum\alpha(m,r\alpha)\right)+1.

See also

References

. Serge Lang . Elliptic Curves: Diophantine Analysis . 231 . Grundlehren der mathematischen Wissenschaften . . 1978 . 0-387-08489-4 .

. The Algorithmic Resolution of Diophantine Equations . 41 . London Mathematical Society Student Texts . Nigel Smart (cryptographer) . . 1998 . 0-521-64633-2 .

Notes and References

  1. Galbraith. S.D.. Paulhus. S.M.. Smart. N.P.. Arithmetic on superelliptic curves. Mathematics of Computation. 71. 2002. 394–405. 1863009. 10.1090/S0025-5718-00-01297-7. free.