Superelliptic curve

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

where is an integer and f is a polynomial of degree with coefficients in a field ; more precisely, it is the smooth projective curve whose function field defined by this equation. The case and is an elliptic curve, the case and is a hyperelliptic curve, and the case and is an example of a trigonal curve.

Some authors impose additional restrictions, for example, that the integer should not be divisible by the characteristic of , that the polynomial 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

of the projective line of degree coprime to the characteristic of the field of definition. The degree 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 defined over a field has an affine model given by an equation

for some polynomial of degree with each root having order , provided that has a point defined over , that is, if the set of -rational points of is not empty. For example, this is always the case when is algebraically closed. In particular, function field extension is a Kummer extension.

Ramification

Let be a superelliptic curve defined over an algebraically closed field , and denote the set of roots of in . Define set

Then is the set of branch points of the covering map given by .

For an affine branch point , let denote the order of as a root of . As before, we assume that . Then

is the ramification index at each of the ramification points of the curve lying over (that is actually true for any ).

For the point at infinity, define integer as follows. If

then . Note that . Then analogously to the other ramification points,

is the ramification index at the points that lie over . In particular, the curve is unramified over infinity if and only if its degree divides .

Curve defined as above is connected precisely when and are relatively prime (not necessarily pairwise), which is assumed to be the case.

gollark: It's obviously on page 42.
gollark: Presumably, they just take the input executable, compress/encrypt/whatever its machine code, and store it as data in a new executable which also contains code to decompress/decrypt/whatever it and load it into memory from which it can be executed, but also presumably you already knew that and it's not very helpful.
gollark: zstandard
gollark: Actually, use formatting to pack in extra data, like in the X language.
gollark: Mildly more efficient.

See also

References

  1. Galbraith, S.D.; Paulhus, S.M.; Smart, N.P. (2002). "Arithmetic on superelliptic curves". Mathematics of Computation. 71: 394–405. doi:10.1090/S0025-5718-00-01297-7. MR 1863009.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.