Abstract
Let be an odd prime, and let be a field of characteristic not or containing a primitive -th root of unity. For an elliptic curve over , we consider the standard Galois representation and denote the fixed field of its kernel by . Recently, the last author gave an algorithm to compute elements in the Brauer group explicitly, deducing an upper bound of on the symbol length in . More precisely, the symbol length is bounded above by . We improve this bound to if . Under the additional assumption that contains an element of order , we further reduce it to . In particular, these bounds hold for all CM elliptic curves, in which case we deduce a general upper bound of . We provide an algorithm implemented in SageMath to compute these symbols explicitly over number fields.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.