Related papers: Computing the Hilbert Class Fields of Quartic CM F…

In this paper, we describe an algorithm that efficiently collect relations in class groups of number fields defined by a small defining polynomial. This conditional improvement consists in testing directly the smoothness of principal ideals…

Let O be a maximal order in a totally indefinite quaternion algebra over a totally real number field. In this note we study the locus Q_O of quaternionic multiplication by O in the moduli space A_g of principally polarized abelian varieties…

We adapt the CRT approach for computing Hilbert class polynomials to handle a wide range of class invariants. For suitable discriminants D, this improves its performance by a large constant factor, more than 200 in the most favourable…

We design efficient algorithms to evaluate modular equations of Siegel and Hilbert type for abelian surfaces over number fields or finite fields using complex approximations. Their output is provably correct when the associated graded ring…

We give an explicit necessary condition for pairs of orders in a quartic CM-field to have the same polarised class group. This generalises a simpler result for imaginary quadratic fields. We give an application of our results to computing…

Let k be an imaginary quadratic number field (with class number 1). We describe a new, essentially linear-time algorithm, to list all isomorphism classes of cubic extensions L/k up to a bound X on the norm of the relative discriminant…

An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q corresponding to each polynomial. This paper studies the degrees of polynomials over binary field that associated with…

Let $K$ be an imaginary biquadratic field and $K_1$, $K_2$ be its imaginary quadratic subfields. For integers $N>0$, $\mu\geq 0$ and an odd prime $p$ with $\gcd(N,p)=1$, let $K_{(Np^\mu)}$ and $(K_i)_{(Np^\mu)}$ for $i=1,2$ be the ray class…

In the present work we give the construction of the genus field and the extended genus field of an elementary abelian $l$-extension of a field of rational functions, where $l$ is a prime number. In the Kummer case, if $K$ is contained in a…

We introduce a notion of highly Kummer-faithful fields and study its relationship with the notion of Kummer-faithful fields. We also give some examples of highly Kummer-faithful fields. For example, if $k$ is a number field of finite degree…

The number of non-isomorphic cubic fields L sharing a common discriminant d(L) = d is called the multiplicity m = m(d) of d. For an assigned value of d, these fields are collected in a multiplet M(d) = (L(1) ,..., L(m)). In this paper, the…

We continue the study of counting complexity begun in [Buergisser, Cucker 04] and [Buergisser, Cucker, Lotz 05] by proving upper and lower bounds on the complexity of computing the Hilbert polynomial of a homogeneous ideal. We show that the…

Using the notion of quantum integers associated with a complex number $q\neq 0$, we define the quantum Hilbert matrix and various extensions. They are Hankel matrices corresponding to certain little $q$-Jacobi polynomials when $|q|<1$, and…

Let $K$ be a number field with ring of integers $\mathcal{O}_K$ and let $G$ be a finite abelian group of odd order. Given a $G$-Galois $K$-algebra $K_h$, let $A_h$ denote its square root of the inverse different, which exists by Hilbert's…

We develop a general classification theory for Brumer's dihedral quintic polynomials by means of Kummer theory arising from certain elliptic curves. We also give a similar theory for cubic polynomials.

For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields of K/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then…

Classical theory of Complex Multiplication (CM) shows that all abelian extensions of a complex quadratic field $K$ are generated by the values of appropriate modular functions at the points of finite order of elliptic curves whose…

One standard approach to compute the Hilbert function of any graded module over a field is to come up with a free-resolution for the graded module and another is via a Hilbert power series which serves as a generating function. The proposed…

In 1960 Schwinger [J. Schwinger, Proc.Natl.Acad.Sci. 46 (1960) 570- 579] proposed the algorithm for factorization of unitary operators in the finite M dimensional Hilbert space according to a coprime decomposition of M. Using a special…

We present a space-efficient algorithm to compute the Hilbert class polynomial H_D(X) modulo a positive integer P, based on an explicit form of the Chinese Remainder Theorem. Under the Generalized Riemann Hypothesis, the algorithm uses…