相关论文: Counting (skew-)reciprocal Littlewood polynomials …

In the paper we partially solved the problem of the distribution of the discriminants of integral polynomials in the cubic case. We proved the asymptotic formula for the number of integral cubic polynomials having bounded height and bounded…

We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…

Particular class of skew orthogonal polynomials are introduced and investigated, which possess Laurent symmetry. They are also shown to appear as eigenfunctions of symplectic generalized eigenvalue problems. The modification of these…

Let $Q_n(x)=\sum_{i=0}^{n} A_{i}x^{i}$ be a random polynomial where the coefficients $A_0,A_1,... $ form a sequence of centered Gaussian random variables. Moreover, assume that the increments $\Delta_j=A_j-A_{j-1}$, $j=0,1,2,...$ are…

We investigate average gradient degree of normal random polynomials of fixed algebraic degree n. In particular, for polynomials of two variables, asymptotics of the average gradient degree for large values of n is determined.

The paper has three parts. In the first part we apply the theory of commuting pairs of (pseudo) difference operators to the (formal) asymptotics of orthogonal polynomials: using purely geometrical arguments we show heuristically that the…

We provide an asymptotic expression for the probability that a randomly chosen polynomial with given degree, having integral coefficients bounded by some B, has a prescribed signature. We also give certain related formulas and numerical…

Assume that the Riemann hypothesis holds for Dedekind zeta functions. Under this assumption, we prove that a degree $d$ polynomial with random multiplicative $\pm1$ coefficients is irreducible in $\mathbb{Z}[x]$ with probability…

We study solutions of three-term recurrence relations whose $N$-step transfer matrices belong to the uniform Stolz class. In particular, we derive the first order of their uniform asymptotics. For orthonormal polynomials we show more.…

For an additive polynomial and a positive integer, we define an irreducible smooth representation of a Weil group of a non-archimedean local field. We study several invariants of this representation. We deduce a necessary and sufficient…

We consider sequences of biorthogonal polynomials with respect to a Cauchy type convolution kernel and give the weak and ratio asymptotic of the corresponding sequences of biorthogonal polynomials. The construction is intimately related…

In this short lecture, we compute asymptotics of orthogonal polynomials, from a saddle point approximation. This is an example of a calculation which shows the link between integrability, algebraic geometry and random matrices.

This paper is partly a survey of known results on quadratic forms that are hard to find in the literature. Our main focus is a twisted form of a construction due to Bezout. This skew Bezoutian is a symplectic (resp. quadratic) space…

We generalize a theorem of Littlewood concerning the factorization of Schur polynomials when their variables are twisted by roots of unity. We show that a certain family of flagged skew Schur polynomials admit a similar factorization. These…

We investigate the recurrence coefficients of discrete orthogonal polynomials on the non-negative integers with hypergeometric weights and show that they satisfy a system of non-linear difference equations and a non-linear second order…

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…

Non-Hermitian random matrices with symplectic symmetry provide examples for Pfaffian point processes in the complex plane. These point processes are characterised by a matrix valued kernel of skew-orthogonal polynomials. We develop their…

We consider random trigonometric polynomials with general dependent coefficients. We show that under mild hypotheses on the structure of dependence, the asymptotics as the degree goes to infinity of the expected number of real zeros…

In this note, we prove a central limit theorem for smooth linear statistics of zeros of random polynomials which are linear combinations of orthogonal polynomials with iid standard complex Gaussian coefficients. Along the way, we obtain…

A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…