Related papers: Algorithms for computing norms and characteristic …
We present a new algorithm for computing the endomorphism ring of an ordinary abelian surface over a finite field which is subexponential and generalizes an algorithm of Bisson and Sutherland for elliptic curves. The correctness of this…
We present a new algorithm for computing integral bases in algebraic function fields of one variable, or equivalently for constructing the normalization of a plane curve. Our basic strategy makes use of the concepts of localization and…
We describe how Groebner bases can be used to solve the reduction problem for Feynman integrals, i.e. to construct an algorithm that provides the possibility to express a Feynman integral of a given family as a linear combination of some…
We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…
We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…
Let $A=\mathbb{F}_q[T]$ be the polynomial ring over $\mathbb{F}_q$, and $F$ be the field of fractions of $A$. Let $\phi$ be a Drinfeld $A$-module of rank $r\geq 2$ over $F$. For all but finitely many primes $\mathfrak{p}\lhd A$, one can…
When the parameter $q\in\mathbb C^*$ is not a root of unity, simple modules of affine $q$-Schur algebras have been classified in terms of Frenkel--Mukhin's dominant Drinfeld polynomials (\cite[4.6.8]{DDF}). We compute these Drinfeld…
Let $q\geq2$ be a prime power and consider Drinfeld modules of rank 2 over $\mathbb{F}_q[T]$. We prove that there are no points with coordinates being Drinfeld singular moduli, on a family of hyperbolas $XY=\gamma$, where $\gamma$ is a…
Let $\mathcal{E}$ be an elliptic curve over a field $K$ and $\ell$ a prime. There exists an elliptic curve $\mathcal{E}^*$ related to $\mathcal{E}$ by anisogeny (rational map that is also a group homomorphisms) of degree $\ell$ if and only…
We give an efficient, deterministic algorithm to decide if two abelian varieties over a number field are isogenous. From this, we derive an algorithm to compute the endomorphism ring of an elliptic curve over a number field.
In this paper we present an algorithm for construction of minimal involutive polynomial bases which are Groebner bases of the special form. The most general involutive algorithms are based on the concept of involutive monomial division…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
Rank-2 Drinfeld modules are a function-field analogue of elliptic curves, and the purpose of this paper is to investigate similarities and differences between rank-2 Drinfeld modules and elliptic curves in terms of supersingularity.…
Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…
For any quantum group of finite ADE type, we prove a new formula for the standard bilinear form evaluated at monomials. Combining this with ideas from the Lusztig-Shoji algorithm, we obtain a new algorithm that computes the canonical basis.…
Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
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 provide an algorithm to classify the asymptotic sets of the dominant polynomial mappings $F: \C^3 \to \C^3$ of degree 2, using the definition of the so-called "{\it fa\c{c}ons}" in \cite{Thuy}. We obtain a classification theorem for the…
We introduce a new technique to construct rank-metric codes using the arithmetic theory of Drinfeld modules over global fields, and Dirichlet Theorem on polynomial arithmetic progressions. Using our methods, we obtain a new infinite family…