Related papers: Division polynomials for arbitrary isogenies

We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…

For a natural extension of the circular unitary ensemble of order n, we study as n tends to infinity, the asymptotic behavior of the sequence of orthogonal polynomials with respect to the spectral measure. The last term of this sequence is…

We count by height the number of elliptic curves over the rationals, both up to isomorphism over the rationals and over an algebraic closure thereof, that admit a cyclic isogeny of degree $7$.

The orthogonal derivative is defined as a limit of an integral whose kernel contains an orthogonal polynomial with its measure. When in practice no limit is taken, it means that the accuracy of the derivative depends on the second…

We introduce the notion of Kravchuk derivations of the polynomial algebra. We prove that any element of the kernel of the derivation gives a polynomial identity satisfied by the Kravchuk polynomials. Also, we prove that any kernel element…

Let E be an elliptic curve over a number field K which admits a cyclic p-isogeny with p odd and semistable at primes above p. We determine the root number and the parity of the p-Selmer rank for E/K, in particular confirming the parity…

An isogeny graph is a graph whose vertices are principally polarized abelian varieties and whose edges are isogenies between these varieties. In his thesis, Kohel described the structure of isogeny graphs for elliptic curves and showed that…

Let $E$ be an elliptic surface over the curve $C$, defined over a number field $k$, let $P$ be a section of $E$, and let $\ell$ be a rational prime. For any non-singular fibre $E_t$, we bound the number of points $Q$ on $E_t$ of (algebraic)…

A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…

In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…

We prove a function field analog of Weyl's classical theorem on equidistribution of polynomial sequences. Our result covers the case in which the degree of the polynomial is greater than or equal to the characteristic of the field, which is…

In these lecture notes we present some connections between random matrices, the asymmetric exclusion process, random tilings. These three apparently unrelated objects have (sometimes) a similar mathematical structure, an interlacing…

We introduce a "workable" notion of degree for non-homogeneous polynomial ideals and formulate and prove ideal theoretic B\'ezout Inequalities for the sum of two ideals in terms of this notion of degree and the degree of generators. We…

A new class of distributional transformations is introduced, characterized by equations relating function weighted expectations of test functions on a given distribution to expectations of the transformed distribution on the test function's…

Orthogonal polynomials and multiple orthogonal polynomials are interesting special functions because there is a beautiful theory for them, with many examples and useful applications in mathematical physics, numerical analysis, statistics…

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…

We bound the location of roots of polynomials that have nonnegative coefficients with respect to a fixed but arbitrary basis of the vector space of polynomials of degree at most $d$. For this, we interpret the basis polynomials as vector…

In his monograph [Classical and quantum orthogonal polynomials in one variable, Cambridge University Press, 2005 (paperback edition 2009)], Ismail conjectured that certain structure relations involving the Askey-Wilson operator characterize…

To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…

These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…