Related papers: Computing Hilbert class polynomials with the Chine…

We present a new method for solving the hidden polynomial graph problem (HPGP) which is a special case of the hidden polynomial problem (HPP). The new approach yields an efficient quantum algorithm for the bivariate HPGP even when the input…

We find a local $(d+1) \times (d+1)$ Riemann-Hilbert problem characterizing the skew-orthogonal polynomials associated to the partition function of the Gaussian Orthogonal Ensemble of random matrices with a potential function of degree $d$.…

This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian…

We compute the dimension of the Hilbert scheme of subvarieties of positive dimension in projective space which are cut by maximal minors of a matrix with polynomial entries.

In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…

We present a variation of the modular algorithm for computing the Hermite Normal Form of an $\OK$-module presented by Cohen, where $\OK$ is the ring of integers of a number field K. The modular strategy was conjectured to run in polynomial…

For the integer $ D=pq$ of the product of two distinct odd primes, we construct an elliptic curve $E_{2rD}:y^2=x^3-2rDx$ over $\mathbb Q$, where $r$ is a parameter dependent on the classes of $p$ and $q$ modulo 8, and show, under the parity…

We present an application of Hilbert quasi-polynomials to order domains, allowing the effective check of the second order-domain condition in a direct way. We also provide an improved algorithm for the computation of the related Hilbert…

Let E be an elliptic curve having Complex Multiplication by the full ring O_K of integers of K=Q(\sqrt{-D}), let H=K(j(E)) be the Hilbert class field of K. Then the Mordell-Weil group E(H) is an O_K-module, and its structure denpends on its…

Assuming GRH, we present an algorithm which inputs a prime $p$ and outputs the set of fundamental discriminants $D<0$ such that the reduction map modulo a prime above $p$ from elliptic curves with CM by $\order_{D}$ to supersingular…

We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions and on interpolation, which has received little attention in…

Let P and Q be two polynomials in K[x, y] with degree at most d, where K is a field. Denoting by R $\in$ K[x] the resultant of P and Q with respect to y, we present an algorithm to compute R mod x^k in O~(kd) arithmetic operations in K,…

We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…

The Qth-power algorithm produces a useful canonical P-module presentation for the integral closures of certain integral extensions of $P:=\mathbf{F}[x_n,...,x_1]$, a polyonomial ring over the finite field $\mathbf{F}:=\mathbf{Z}_q$ of $q$…

We study the method of cyclic projections when applied to closed and linear subspaces $M_i$, $i=1,\ldots,m$, of a real Hilbert space $\mathcal H$. We show that the average distance to individual sets enjoys a polynomial behaviour…

We present an algorithm for computing discriminants and prime ideal decomposition in number fields. The algorithm is a refinement of a p-adic factorization method based on Newton polygons of higher order. The running-time and memory…

We construct the derived version of the Hilbert scheme parametrizing subschemes in a given projective scheme X with given Hilbert polynomial h. This is a dg-manifold (smooth dg-scheme) RHilb_h(X) which carries a natural family of…

We present a new algorithm by which the Adomian polynomials can be determined for scalar-valued nonlinear polynomial functional in a Hilbert space. This algorithm calculates the Adomian polynomials without the complicated operations such as…

We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime integers. We also propose an efficient linear data structure, a…

We propose a generic design for Chinese remainder algorithms. A Chinese remainder computation consists in reconstructing an integer value from its residues modulo non coprime integers. We also propose an efficient linear data structure, a…