Related papers: Division polynomials for arbitrary isogenies
Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…
We recall and define various kinds of supersingular $\ell$-isogeny graphs and precise graph isomorphism with a corresponding quaternion $\ell$-ideal graph. In particular, we introduce the notion of double-orientations on supersingular…
This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.
Let $K$ be a field of characteristic different from $2$, $\bar{K}$ its algebraic closure. Let $n \ge 3$ be an odd integer. Let $f(x)$ and $h(x)$ be degree $n$ polynomials with coefficients in $K$ and without repeated roots. Let us consider…
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…
We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…
We present a simple and elementary procedure to sketch the tropical conic given by a degree--two homogeneous tropical polynomial. These conics are trees of a very particular kind. Given such a tree, we explain how to compute a defining…
We consider here a particular quadratic equation linking two elements of a C-Algebra. By analysing powers of the unknowns, it appears a double sequence of polynomials related to classical Bernoulli polynomials. We get the generating…
In this work, the concept of quasi-type Kernel polynomials with respect to a moment functional is introduced. Difference equation satisfied by these polynomials along with the criterion for orthogonality conditions are discussed. The…
The associativity property, usually defined for binary functions, can be generalized to functions of a given fixed arity n>=1 as well as to functions of multiple arities. In this paper, we investigate these two generalizations in the case…
Let $D$ be a domain obtained by removing, out of the unit disk $\{z:|z|<1\}$, finitely many mutually disjoint closed disks, and for each integer $n\geq 0$, let $P_n(z)=z^n+\cdots$ be the monic $n$th-degree polynomial satisfying the planar…
Let $K$ be a quadratic field which is not an imaginary quadratic field of class number one. We describe an algorithm to compute the primes $p$ for which there exists an elliptic curve over $K$ admitting a $K$-rational $p$-isogeny. This…
Isogenies occur throughout the theory of elliptic curves. Recently, the cryptographic protocols based on isogenies are considered as candidates of quantum-resistant cryptographic protocols. Given two elliptic curves $E_1, E_2$ defined over…
We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…
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…
We consider an algebraic variety and its foliation, both defined over a number field. We prove upper bounds for the geometric complexity of the intersection between a leaf of the foliation and a subvariety of complementary dimension (also…
Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…
The notion of a root functional of polynomials is a generalization of the notion of a root for a multiple root. A root functional is a linear functional that is defined on a polynomial ring and annuls the ideal of a system of polynomials. A…
Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…