相关论文: Computing the Characteristic Polynomial of Endomor…

We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…

Motivated by finding analogues of elliptic curve point counting techniques, we introduce one deterministic and two new Monte Carlo randomized algorithms to compute the characteristic polynomial of a finite rank-two Drinfeld module. We…

We describe an algorithm to count the number of rational points of an hyperelliptic curve defined over a finite field of odd characteristic which is based upon the computation of the action of the Frobenius morphism on a basis of the…

New algorithms are presented for computing annihilating polynomials of Toeplitz, Hankel, and more generally Toeplitz+ Hankel-like matrices over a field. Our approach follows works on Coppersmith's block Wiedemann method with structured…

We describe an algorithm for counting points on an arbitrary hyperelliptic curve over a finite field of odd characteristic, using Monsky-Washnitzer cohomology to compute a p-adic approximation to the characteristic polynomial of Frobenius.…

We present a novel randomized algorithm to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo…

In this paper we generalize the classical Groebner basis technique to prove the existence and present a method of computation of a dimension polynomial in two variables associated with a finitely generated D-module, that is, a finitely…

We compute the moduli of endomorphisms of the de Rham and crystalline cohomology functors, viewed as a cohomology theory on smooth schemes over truncated Witt vectors. As applications of our result, we deduce Drinfeld's refinement of the…

Let $X$ be a smooth projective curve over a finite field of characteristic $p$. We describe and implement a practical algorithm for computing the $p$-divisible group $Jac(X)[p^\infty]$ via computing its Dieudonn\'{e} module, or equivalently…

We introduce differential characters of Drinfeld modules. These are function-field analogues of Buium's p-adic differential characters of elliptic curves and of Manin's differential characters of elliptic curves in differential algebra,…

Let $\mathbb{F}_q[T]$ be the polynomial ring over a finite field $\mathbb{F}_q$. We study the endomorphism rings of Drinfeld $\mathbb{F}_q[T]$-modules of arbitrary rank over finite fields. We compare the endomorphism rings to their subrings…

We present novel algorithms to factor polynomials over a finite field $\F_q$ of odd characteristic using rank $2$ Drinfeld modules with complex multiplication. The main idea is to compute a lift of the Hasse invariant (modulo the polynomial…

We give an effective algorithm to determine the endomorphism ring of a Drinfeld module, both over its field of definition and over a separable or algebraic closure thereof. Using previous results we deduce an effective description of the…

Kedlaya's algorithm (Kedlaya, J. Ramanujan Math. Soc 16, 2001) can be used to count the points of arbitrary hyperelliptic curves over finite fields of characteristic p, where p is an odd prime. The algorithm uses the cohomology of a p-adic…

We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank $2$ Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from…

In this paper we present algorithms that compute certain local cohomology modules associated to a ring of polynomials containing the rational numbers. In particular we are able to compute the local cohomological dimension of algebraic…

We establish the existence of the Bernstein polynomial in one indeterminate $t$, and provide a method for its explicit computation. The Bernstein polynomial is associated with finitely generated modules over the Weyl algebra, known as…

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…

This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…

For a polynomial ring $R=k[x_1,...,x_n]$, we present a method to compute the characteristic cycle of the localization $R_f$ for any nonzero polynomial $f\in R$ that avoids a direct computation of $R_f$ as a $D$-module. Based on this…