Related papers: Computing class groups and gonalities of algebraic…

Inside the symmetric product of a very general curve, we consider the codimension-one subvarieties of symmetric tuples of points imposing exceptional secant conditions on linear series on the curve of fixed degree and dimension. We compute…

The unipotent groups are an important class of algebraic groups. We show that techniques used to compute with finitely generated nilpotent groups carry over to unipotent groups. We concentrate particularly on the maximal unipotent subgroup…

Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…

Let $\epsilon>0$. In this article we will present a deterministic algorithm which does the following. The input is a hyperelliptic curve $C$ of genus $g$ over a finite field $k$ of cardinality $q$ given by $y^2+h(x)y=f(x)$ such that the…

We establish a valuative version of Grothendieck's section conjecture for curves over p-adic local fields. The image of every section is contained in the decomposition subgroup of a valuation which prolongs the p-adic valuation to the…

We classify Galois objects for the dual of a group algebra of a finite group over an arbitrary field.

Class field theory furnishes an intrinsic description of the abelian extensions of a number field that is in many cases not of an immediate algorithmic nature. We outline the algorithms available for the explicit computation of such…

We study the arithmetic (geometric) progressions in the $x$-coordinates of quadratic points on smooth projective planar curves defined over a number field $k$. Unless the curve is hyperelliptic, we prove that these progressions must be…

We classify, up to equivalence, all finite-dimensional simple graded division algebras over the field of real numbers. The grading group is any finite abelian group.

We apply classical invariant theory of binary forms to explicitly characterize isomorphism classes of hyperelliptic curves of small genus and, conversely, propose algorithms for reconstructing hyperelliptic models from given invariants. We…

We present an index calculus algorithm with double large prime variation which lends itself well to a rigorous analysis. Using this algorithm we prove that for fixed genus $g \geq 2$, the discrete logarithm problem in degree 0 class groups…

We present an algorithm for computing the 2-group of narrow logarithmic divisor classes of degree 0 for number fields F. As an application, we compute in some cases the 2-rank of the wild kernel WK2(F).

We give an algorithm for solving equations and inequations with rational constraints in virtually free groups. Our algorithm is based on Rips classification of measured band complexes. Using canonical representatives, we deduce an algorithm…

We start with $n$-torsions in the Jacobian of an $m$-gonal curve and produce $n$-torsions in the class group of certain number field $K$.

This is a book about computational aspects of modular forms and the Galois representations attached to them. The main result is the following: Galois representations over finite fields attached to modular forms of level one can, in almost…

We present an algorithm for computing the 2-group of the positive divisor classes of a number field F in case F has exceptional dyadic places. As an application, we compute the 2-rank of the wild kernel WK2(F) in K2(F) for such number…

We discuss various methods and their effectiveness for solving linear equations over finitely generated abelian groups. More precisely, if $\varphi\colon G\to H$ is a homomorphism of finitely generated abelian groups and $b\in H$, we…

This paper provides an algorithm enumerating superspecial trigonal curves of genus $5$ over finite fields. Executing the algorithm over a computer algebra system Magma, we enumerate them over finite fields $\mathbb{F}_{p^a}$ for any natural…

Efficiently simulating quantum circuits on classical computers is a fundamental challenge in quantum computing. This paper presents a novel theoretical approach that achieves substantial speedups over existing simulators for a wide class of…

Shanks's infrastructure algorithm and Buchmann's algorithm for computing class groups and unit groups of rings of integers of algebraic number fields are most naturally viewed as computations inside Arakelov class groups. In this paper we…