Zero distribution and division results for exponential polynomials

An exponential polynomial of order q is an entire function of the form

$$g(z) = {P_1}(z){e^{{Q_1}(z)}} + ...{P_k}(z){e^{{Q_k}(z)}},$$

where the coefficients P_j(z),Q_j(z) are polynomials in z such that

$$\max \{ deg({Q_j})\} = q.$$

It is known that the majority of the zeros of a given exponential polynomial are in domains surrounding finitely many critical rays. The shape of these domains is refined by showing that in many cases the domains can approach the critical rays asymptotically. Further, it is known that the zeros of an exponential polynomial are always of bounded multiplicity. A new sufficient condition for the majority of zeros to be simple is found. Finally, a division result for a quotient of two exponential polynomials is proved, generalizing a 1929 result by Ritt in the case q = 1 with constant coefficients. Ritt’s result is closely related to Shapiro’s conjecture that has remained open since 1958.

     

Polynomial root radius optimization with affine constraints

The root radius of a polynomial is the maximum of the moduli of its roots (zeros). We consider the following optimization problem: minimize the root radius over monic polynomials of degree n, with either real or complex coefficients, subject to k linearly independent affine constraints on the coefficients. We show that there always exists an optimal polynomial with at most \(k-1\) inactive roots, that is, roots whose moduli are strictly less than the optimal root radius. We illustrate our results using some examples arising in feedback control.     

Polynomials defining many units

We classify the polynomials with integral coefficients that, when evaluated on a group element of finite order n, define a unit in the integral group ring for infinitely many positive integers n. We show that this happens if and only if the polynomial defines generic units in the sense of Marciniak and Sehgal. We also classify the polynomials with integral coefficients which provides units when evaluated on n-roots of a fixed integer a for infinitely many positive integers n.     

Irreducibility criteria for compositions of polynomials with integer coefficients

We provide irreducibility criteria for some classes of compositions of polynomials with integer coefficients of the form \(F\circ G\), with F being a quadratic irreducible polynomial and G a polynomial of arbitrary degree.     

Irreducibility criteria of Schur-type and Pólya-type

Let \({f(x)=(x-a_1)\cdots (x-a_m)}\), where a ₁, . . . , a _m are distinct rational integers. In 1908 Schur raised the question whether f(x) ± 1 is irreducible over the rationals. One year later he asked whether \({(f(x))^{2^k}+1}\) is irreducible for every k ≥ 1. In 1919 Pólya proved that if \({P(x)\in\mathbb{Z}[x]}\) is of degree m and there are m rational integer values a for which 0 < |P(a)| < 2^?N N! where \({N=\lceil m/2\rceil}\), then P(x) is irreducible. A great number of authors have published results of Schur-type or Pólya-type afterwards. Our paper contains various extensions, generalizations and improvements of results from the literature. To indicate some of them, in Theorem 3.1 a Pólya-type result is established when the ground ring is the ring of integers of an arbitrary imaginary quadratic number field. In Theorem 4.1 we describe the form of the factors of polynomials of the shape h(x) f(x) + c, where h(x) is a polynomial and c is a constant such that |c| is small with respect to the degree of h(x) f(x). We obtain irreducibility results for polynomials of the form g(f(x)) where g(x) is a monic irreducible polynomial of degree ≤ 3 or of CM-type. Besides elementary arguments we apply methods and results from algebraic number theory, interpolation theory and diophantine approximation.     

Polynomial forms for quantum elliptic Calogero–Moser Hamiltonians

We hypothesize the form of a transformation reducing the elliptic A _N Calogero–Moser operator to a differential operator with polynomial coefficients. We verify this hypothesis for N ≤ 3 and, moreover, give the corresponding polynomial operators explicitly.     

Zeros of Jacobi polynomials Pn( α, β)$ P_{n}^{(\alpha ,\beta)} $, − 2 < α, β < − 1

The sequence of Jacobi polynomials \(\{P_{n}^{(\alpha ,\beta )}\}_{n = 0}^{\infty }\) is orthogonal on (??1,1) with respect to the weight function (1 ? x)^α(1 + x)^β provided α > ??1,β > ??1. When the parameters α and β lie in the narrow range ??2 < α, β < ??1, the sequence of Jacobi polynomials \(\{P_{n}^{(\alpha ,\beta )}\}_{n = 0}^{\infty }\) is quasi-orthogonal of order 2 with respect to the weight function (1 ? x)^α+?1(1 + x)^β+?1 and each polynomial of degree n,n ≥?2, in such a Jacobi sequence has n real zeros. We show that any sequence of Jacobi polynomials \(\{P_{n}^{(\alpha ,\beta )}\}_{n = 0}^{\infty }\) with ??2 < α, β < ??1, cannot be orthogonal with respect to any positive measure by proving that the zeros of Pn??1(α,β) do not interlace with the zeros of Pn(α,β) for any \(n \in \mathbb {N},\)n ≥?2, and any α,β lying in the range ??2 < α, β < ??1. We also investigate interlacing properties satisfied by the zeros of equal degree Jacobi polynomials Pn(α,β),Pn(α,β+?1) and Pn(α+?1,β+?1) where ??2 < α, β < ??1. Upper and lower bounds for the extreme zeros of quasi-orthogonal order 2 Jacobi polynomials Pn(α,β) with ??2 < α, β < ??1 are derived.     

Rapidly computing sparse Legendre expansions via sparse Fourier transforms

In this paper, we propose a general strategy for rapidly computing sparse Legendre expansions. The resulting methods yield a new class of fast algorithms capable of approximating a given function f : [?1, 1] → ? with a near-optimal linear combination of s Legendre polynomials of degree ≤ N in just \((s \log N)^{\mathcal {O}(1)}\)-time. When s ? N, these algorithms exhibit sublinear runtime complexities in N, as opposed to traditional Ω(NlogN)-time methods for computing all of the first N Legendre coefficients of f. Theoretical as well as numerical results demonstrate the effectiveness of the proposed methods.     

Construction of optimal quadrature formulas for Fourier coefficients in Sobolev space $L_{2}^{(m)}(0,1)$

This paper studies the problem of construction of optimal quadrature formulas in the sense of Sard in the \(L_{2}^{(m)}(0,1)\) space for numerical calculation of Fourier coefficients. Using the S.L.Sobolev’s method, we obtain new optimal quadrature formulas of such type for N+1≥m, where N+1 is the number of nodes. Moreover, explicit formulas for the optimal coefficients are obtained. We study the order of convergence of the optimal formula for the case m=1. The obtained optimal quadrature formulas in the \(L_{2}^{(m)}(0,1)\) space are exact for P _m?1(x), where P _m?1(x) is a polynomial of degree m?1. Furthermore, we present some numerical results, which confirm the obtained theoretical results.     

Convergent interpolatory quadrature rules and orthogonal polynomials of varying measures

Let (P _n ) be a sequence of polynomials such that P _n (x) >?0 for x ∈ [??1, 1] and \(\lim \limits _{n\to \infty }\text {deg}(P_{n})/n = 1\). Let q _n be the nth monic orthogonal polynomial with respect to \( {P}_{n}^{-1} \) d μ, where μ is a measure on [??1, 1] that is regular in the sense of Stahl and Totik. We prove that the interpolatory quadrature rule with nodes at the zeros of q _n is convergent with respect to μ provided that the zeros of P _n lie outside a certain curve surrounding [??1, 1].     

Some polynomials associated with the $${\vavec{}}$$-Whitney numbes

In the present article, we study three families of polynomials associated with the r-Whitney numbers of the second kind. They are the r-Dowling polynomials, r-Whitney–Fubini polynomials and the r-Eulerian–Fubini polynomials. Then we derive several combinatorial results by using algebraic arguments (Rota’s method), combinatorial arguments (set partitions) and asymptotic methods.     

Nikol’skii inequality for algebraic polynomials on a multidimensional Euclidean sphere

We study the sharp Nikol’skii inequality between the uniform norm and the L _q norm of algebraic polynomials of a given (total) degree n ≥ 1 on the unit sphere \(\mathbb{S}^{m - 1} \) of the Euclidean space ? ^m for 1 ≤ q < ∞. We prove that the polynomial ? _n in one variable with unit leading coefficient that deviates least from zero in the space L _q ^ψ (?1, 1) of functions f such that |f| ^q is summable over (?1, 1) with the Jacobi weight ψ(t) = (1 - t)^α(1 + t)^β, α = (m - 1)/2, β = (m - 3)/2 as a zonal polynomial in one variable t = ξ _m , where x = (ξ ₁, ξ ₂, …, ξ _m ) ∈ \(\mathbb{S}^{m - 1} \), is (in a certain sense, unique) extremal polynomial in the Nikol’skii inequality on the sphere \(\mathbb{S}^{m - 1} \). The corresponding one-dimensional inequalities for algebraic polynomials on a closed interval are discussed.     

Schur positivity and the <Emphasis Type="Italic">q</Emphasis>-log-convexity of the Narayana polynomials

We prove two recent conjectures of Liu and Wang by establishing the strong q-log-convexity of the Narayana polynomials, and showing that the Narayana transformation preserves log-convexity. We begin with a formula of Brändén expressing the q-Narayana numbers as a specialization of Schur functions and, by deriving several symmetric function identities, we obtain the necessary Schur-positivity results. In addition, we prove the strong q-log-concavity of the q-Narayana numbers. The q-log-concavity of the q-Narayana numbers N _q (n,k) for fixed k is a special case of a conjecture of McNamara and Sagan on the infinite q-log-concavity of the Gaussian coefficients.     

On some arithmetic properties of Mahler functions

Mahler functions are power series f(x) with complex coefficients for which there exist a natural number n and an integer ? ≥ 2 such that f(x), f(x^?),..., \(f({x^{{\ell ^{n - 1}}}}),f({x^{{\ell ^n}}})\) are linearly dependent over ?(x). The study of the transcendence of their values at algebraic points was initiated by Mahler around the’ 30s and then developed by many authors. This paper is concerned with some arithmetic aspects of these functions. In particular, if f(x) satisfies f(x) = p(x)f(x^?) with p(x) a polynomial with integer coefficients, we show how the behaviour of f(x) mirrors on the polynomial p(x). We also prove some general results on Mahler functions in analogy with G-functions and E-functions.     

A General Approach to Isolating Roots of a Bitstream Polynomial

We describe a new approach to isolate the roots (either real or complex) of a square-free polynomial F with real coefficients. It is assumed that each coefficient of F can be approximated to any specified error bound and refer to such coefficients as bitstream coefficients. The presented method is exact, complete and deterministic. Compared to previous approaches (Eigenwillig in Real root isolation for exact and approximate polynomials using Descartes’ rule of signs, PhD thesis, Universität des Saarlandes, 2008; Eigenwillig et al. in CASC, LNCS, 2005; Mehlhorn and Sagraloff in J. Symb. Comput. 46(1):70–90, 2011) we improve in two aspects. Firstly, our approach can be combined with any existing subdivision method for isolating the roots of a polynomial with rational coefficients. Secondly, the approximation demand on the coefficients and the bit complexity of our approach is considerably smaller. In particular, we can replace the worst-case quantity σ(F) by the average-case quantity \({\prod_{i=1}^n\sqrt[n] {\sigma_i}}\) , where σ _i denotes the minimal distance of the i -th root ξ _i of F to any other root of F, σ(F) := min _i σ _i , and n = deg F. For polynomials with integer coefficients, our method matches the best bounds known for existing practical algorithms that perform exact operations on the input coefficients.     

Definability of Frobenius orbits and a result on rational distance sets

We prove that the first order theory of (possibly transcendental) meromorphic functions of positive characteristic \(p>2\) is undecidable. We also establish a negative solution to an analogue of Hilbert’s tenth problem for such fields of meromorphic functions, for Diophantine equations including vanishing conditions. These undecidability results are proved by showing that the binary relation \(\exists s\ge 0, f=g^{p^s}\) is positive existentially definable in such fields. We also prove that the abc conjecture implies a solution to the Erdös–Ulam problem on rational distance sets. These two seemingly distant topics are addressed by a study of power values of bivariate polynomials of the form F(X)G(Y).     

Strong factorization property of Macdonald polynomials and higher-order Macdonald’s positivity conjecture

We prove a strong factorization property of interpolation Macdonald polynomials when q tends to 1. As a consequence, we show that Macdonald polynomials have a strong factorization property when q tends to 1, which was posed as an open question in our previous paper with Féray. Furthermore, we introduce multivariate q, t-Kostka numbers and we show that they are polynomials in q, t with integer coefficients by using the strong factorization property of Macdonald polynomials. We conjecture that multivariate q, t-Kostka numbers are in fact polynomials in q, t with nonnegative integer coefficients, which generalizes the celebrated Macdonald’s positivity conjecture.     

On the zeros of a polynomial

For a polynomial of degree n, we have obtained an upper bound involving coefficients of the polynomial, for moduli of its p zeros of smallest moduli, and then a refinement of the well-known Eneström-Kakeya theorem (under certain conditions).     

Double roots of random littlewood polynomials

We consider random polynomials whose coefficients are independent and uniform on {-1, 1}. We prove that the probability that such a polynomial of degree n has a double root is o(n^-2) when n+1 is not divisible by 4 and asymptotic to \(1/\sqrt 3 \) otherwise. This result is a corollary of a more general theorem that we prove concerning random polynomials with independent, identically distributed coefficients having a distribution which is supported on {-1, 0, 1} and whose largest atom is strictly less than \(\frac{{8\sqrt 3 }}{{\pi {n^2}}}\). In this general case, we prove that the probability of having a double root equals the probability that either -1, 0 or 1 are double roots up to an o(n^-2) factor and we find the asymptotics of the latter probability.