Paper detail

Twists of non-hyperelliptic curves

In this paper we show a method for computing the set of twists of a non-singular projective curve defined over an arbitrary (perfect) field $k$. The method is based on a correspondence between twists and solutions to a Galois embedding problem. When in addition, this curve is non-hyperelliptic we show how to compute equations for the twists. If $k = \mathbb{F}_{q}$ the method then becomes an algorithm, since in this case, the Galois embedding problems that appear are known how to be solved. As an example we compute the set of twists of the non-hyperelliptic genus $6$ curve $x^{7}-y^{3}z^{4}-z^{7} = 0$ when we consider it defined over a number field such that $[k(ζ_{21}):k] = 12$. For each twist equations are exhibited.

preprint2015arXivOpen access

Signal facts

What is known right now

Open access1 author1 topic

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.