In the paper, making use of two inversion theorems for the Stirling numbers and binomial coefficients, the authors present an alternative explicit formula for a sequence of unnamed polynomials, derive two identities connecting the sequence of unnamed polynomials with the Bell polynomials, and recover a known identity connecting the sequence of unnamed polynomials with the Bell polynomials. 1. M...

Unitary matrices have a rich mathematicalstructure which is closely analogous to real symmetric matrices. For real symmetric matrices this structure can be exploited to develop very eecient numerical algorithms and for some of these algorithms unitary analogues are known. Here we present a unitary analogue of the bisection method for symmetric tridiagonal matrices. Recently Delsarte and Genin i...

Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which makes possible implementing a trapdoor mechanism. In this paper we study a public key cryptosystem based on such polynomials, which provides both encryption and ...

We give new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros. As applications we derive several well-known facts, including the reality of zeros of orthogonal polynomials, matching polynomials, Narayana polynomials and Eulerian polynomials. We also settle certain conjectures of Stahl on genus polynomials by proving them for cer...