New integral mean estimates for polynomials

In this paper we prove someL ^P inequalities for polynomials, wherep is any positive number. They are related to earlier inequalities due to A Zygmund, N G De Bruijn, V V Arestov, etc. A generalization of a polynomial inequality concerning self-inversive polynomials, is also obtained.     

On modified Chebyshev polynomials

In this paper some new properties and applications of modified Chebyshev polynomials and Morgan-Voyce polynomials will be presented. The aim of the paper is to complete the knowledge about all of these types of polynomials.     

On evaluating multivariate polynomials over finite fields

Some evaluation methods of multivariate polynomials over finite fields are described and their multiplicative complexity is discussed.     

On some special polynomials

New special functions called -functions are introduced. Connections of -functions with the known Legendre, Chebyshev and Gegenbauer polynomials are given. For -functions the Rodrigues formula is obtained.     

关于勒让德多项式与契贝谢夫多项式间的关系

主要研究勒让德多项式与契贝谢夫多项式之间的关系的性质,利用生成函数和函数级数展开的方法,得出了勒让德多项式与契贝谢夫多项式之间的一个重要关系,这对勒让德多项式与契贝谢夫多项式的研究有一定的推动作用．     

On Kernel polynomials and self-perturbation of orthogonal polynomials

Given an orthogonal polynomial system {Q _n (x)} _n=0 ^∞, define another polynomial system by where α _n are complex numbers and t is a positive integer. We find conditions for {P _n (x)} _n=0 ^∞ to be an orthogonal polynomial system. When t=1 and α₁≠0, it turns out that {Q _n (x)} _n=0 ^∞ must be kernel polynomials for {P _n (x)} _n=0 ^∞ for which we study, in detail, the location of zeros and semi-classical character. Received: November 25, 1999; in final form: April 6, 2000?Published online: June 22, 2001     

On zeros of discrete orthogonal polynomials

We exploit difference equations to establish sharp inequalities on the extreme zeros of the classical discrete orthogonal polynomials, Charlier, Krawtchouk, Meixner and Hahn. We also provide lower bounds on the minimal distance between their consecutive zeros.     

Lower bounds for derivatives of polynomials and Remez type inequalities

P. Turán [Über die Ableitung von Polynomen, Comositio Math. 7 (1939), 89-95] proved that if all the zeros of a polynomial lie in the unit interval , then . Our goal is to study the feasibility of for sequences of polynomials whose zeros satisfy certain conditions, and to obtain lower bounds for derivatives of (generalized) polynomials and Remez type inequalities for generalized polynomials in various spaces.

     

On prime representing polynomials

A heuristic method is presented to determine the number of primesp ≤x, represented by an irreducible polynomialf(n), without non-trivial fixed factor (f(y)<∈Z[y]; n∈Z. The method is applied to two specific polynomials and the results are compared with those of the heuristic approach of Hardy and Littlewood.     

On Fejér's inequalities for the Legendre polynomials

We present various inequalities for the sum where denotes the Legendre polynomial of degree k . Among others we prove that the inequalities hold for all and . The constant factors 2/5 and are sharp. This refines a classical result of Fejér, who proved in 1908 that is nonnegative for all and .     

On sequences of Hurwitz polynomials related to orthogonal polynomials

ABSTRACT

In this contribution, we explore the well-known connection between Hurwitz and orthogonal polynomials. Namely, given a Hurwitz polynomial, it is shown that it can be decomposed into two parts: a polynomial that is orthogonal with respect to some positive measure supported in the positive real axis and its corresponding second-kind polynomial. Conversely, given a sequence of orthogonal polynomials with respect to a positive measure supported in the positive real axis, a sequence of Hurwitz polynomials can be constructed. Based on that connection, we construct sequences of Hurwitz polynomials that satisfy a recurrence relation, in a similar way as the orthogonal polynomials do. Even more, we present a way to construct families of Hurwitz polynomials using two sequences of parameters and a recurrence relation that constitutes an analogue of Favard's theorem in the theory of orthogonal polynomials.     

On Jacobi and continuous Hahn polynomials

Jacobi polynomials are mapped onto the continuous Hahn polynomials by the Fourier transform, and the orthogonality relations for the continuous Hahn polynomials then follow from the orthogonality relations for the Jacobi polynomials and the Parseval formula. In a special case this relation dates back to work by Bateman in 1933 and we follow a part of the historical development for these polynomials. Some applications of this relation are given.

     

On the equationx(x +d 1)…(x + (k - 1)d 1) =y(y +d 2)…(y + (mk - 1)d 2)

For given positive integersm ≥ 2,d ₁ andd ₂, we consider the equation of the title in positive integersx, y andk ≥ 2. We show that the equation implies thatk is bounded. For a fixedk, we give conditions under which the equation implies that max(x, y) is bounded. Dedicated to the memory of Professor K G Ramanathan     

On Eisenstein polynomials and zeta polynomials

Eisenstein polynomials, which were defined by Oura, are analogues of the concept of an Eisenstein series. Oura conjectured that there exist some analogous properties between Eisenstein series and Eisenstein polynomials. In this paper, we provide new analogous properties of Eisenstein polynomials and zeta polynomials. These properties are finite analogies of certain properties of Eisenstein series.     

Local permutation polynomials and the action of e-Klenian groups

Permutation polynomials of finite fields have many applications in Coding Theory, Cryptography and Combinatorics. In the first part of this paper we present a new family of local permutation polynomials based on a class of symmetric subgroups without fixed points, the so called e-Klenian groups. In the second part we use the fact that bivariate local permutation polynomials define Latin Squares, to discuss several constructions of Mutually Orthogonal Latin Squares (MOLS) and, in particular, we provide a new construction of MOLS on size a prime power.     

On random algebraic polynomials

This paper provides asymptotic estimates for the expected number of real zeros and -level crossings of a random algebraic polynomial of the form , where are independent standard normal random variables and is a constant independent of . It is shown that these asymptotic estimates are much greater than those for algebraic polynomials of the form .