$$\pi $$π-Formulas and Gray code

In previous papers we introduced a class of polynomials which follow the same recursive formula as the Lucas–Lehmer numbers, studying the distribution of their zeros and remarking that this distribution follows a sequence related to the binary Gray code. It allowed us to give an order for all the zeros of every polynomial \(L_n\). In this paper, the zeros, expressed in terms of nested radicals, are used to obtain two formulas for \(\pi \): the first can be seen as a generalization of the known formula

$$\begin{aligned} \pi =\lim _{n\rightarrow \infty } 2^{n+1}\cdot \sqrt{2-\underbrace{\sqrt{2+\sqrt{2+\sqrt{2+\cdots +\sqrt{2}}}}}_{n}}, \end{aligned}$$

related to the smallest positive zero of \(L_n\); the second is an exact formula for \(\pi \) achieved thanks to some identities valid for \(L_n\).

     

On permanents and the zeros of rook polynomials

The concept of rook polynomial of a “chessboard” may be generalized to the rook polynomial of an arbitrary rectangular matrix. A conjecture that the rook polynomials of “chessboards” have only real zeros is thus carried over to the rook polynomials of nonnegative matrices. This paper proves these conjectures, and establishes interlacing properties for the zeros of the rook polynomials of a positive matrix and the matrix obtained by striking any one row or any one column.     

Polynomials orthogonal with respect to discrete convolution

The concept of “Discrete Convolution Orthogonality” is introduced and investigated. This leads to new orthogonality relations for the Charlier and Meixner polynomials. This in turn leads to bilinear representations for them. We also show that the zeros of a family of convolution orthogonal polynomials are real and simple. This proves that the zeros of the Rice polynomials are real and simple.     

Symbolic Computation of Newton Sum Rules for the Zeros of Polynomial Eigenfunctions of Linear Differential Operators

A symbolic algorithm based on the generalized Lucas polynomials of first kind is used in order to compute the Newton sum rules for the zeros of polynomial eigenfunctions of linear differential operators with polynomial coefficients.     

Separable polynomials over finite dimensional algebras

In [5] it was shown that for a polynomial P of precise degree n with coefficients in an arbitrary m-ary algebra of dimension d as a vector space over an algebraically closed fields, the zeros of P together with the homogeneous zeros of the dominant part of P form a set of cardinality n^d or the cardinality of the base field. We investigate polynomials with coefficients in a d dimensional algebra A without assuming the base field k to be algebraically closed. Separable polynomials are defined to be those which have exactly n^d distinct zeros in [Ktilde] ?_k A [Ktilde] where [Ktilde] denotes an algebraic closure of k. The main result states that given a separable polynomial of degree n, the field extension L of minimal degree over k for which L ?_k A contains all nd zeros is finite Galois over k. It is shown that there is a non empty Zariski open subset in the affine space of all d-dimensional k algebras whose elements A have the following property: In the affine space of polynomials of precise degree n with coefficients in A there is a non empty Zariski open subset consisting of separable polynomials; in other polynomials with coefficients in a finite dimensional algebra are “generically” separable.     

Some Identities Involving Square of Fibonacci Numbers and Lucas Numbers

By studying the properties of Chebyshev polynomials, some specific and meaningful identities for the calculation of square of Chebyshev polynomials, Fibonacci numbers and Lucas numbers are obtained.     

Number of zeros of interval polynomials

In this paper, we develop a rigorous algorithm for counting the real interval zeros of polynomials with perturbed coefficients that lie within a given interval, without computing the roots of any polynomials. The result generalizes Sturm’s Theorem for counting the roots of univariate polynomials to univariate interval polynomials.     

Simultaneous Lagrange interpolating approximation need not always be convergent

Recently, several publications have been devoted to investigation of simultaneous Lagrange interpolating approximation. In this paper we carefully construct a counterexample with a system of nodes showing that the simultaneous Lagrange interpolating approximation need not always be convergent. It is especially interesting to note that the system of nodes behaving “badly” in this case is exactly the “near optimal choice” in the ordinary Lagrange interpolating case, the zeros of the Chebyshev polynomials.     

Quasi-orthogonality of some hypergeometric polynomials

The zeros of quasi-orthogonal polynomials play a key role in applications in areas such as interpolation theory, Gauss-type quadrature formulas, rational approximation and electrostatics. We extend previous results on the quasi-orthogonality of Jacobi polynomials and discuss the quasi-orthogonality of Meixner–Pollaczek, Hahn, Dual-Hahn and Continuous Dual-Hahn polynomials using a characterization of quasi-orthogonality due to Shohat. Of particular interest are the Meixner–Pollaczek polynomials whose linear combinations only exhibit quasi-orthogonality of even order. In some cases, we also investigate the location of the zeros of these polynomials for quasi-orthogonality of order 1 and 2 with respect to the end points of the interval of orthogonality, as well as with respect to the zeros of different polynomials in the same orthogonal sequence.     

A problem of Boyd concerning geometric means of polynomials

In this paper we derive an equality which characterizes the distribution of the modulus of a polynomial on the unit circle. This inequality is used to prove a conjecture of Boyd concerning the geometric mean of the modulus of a polynomial of several variables averaged over the torus. References are cited which discuss the relationship of this conjecture to a classical question of Lehmer concerning the distribution of roots of polynomials.     

Inners and Schur complement

It is shown that for any square matrix having a left triangle of zeros, the determinants of its inners are equal to the leading principal minors of its Schur complement. In particular, if the original matrix has Sylvester-type form, then relationship between zero location theorems for polynomials are recovered.     

Comparative Testing of Five Numerical Methods for Finding Roots of Polynomials

This paper summarizes the results of comparative testing of (1) Wilf's global bisection method, (2) the Laguerre method, (3) the companion matrix eigenvalue method, (4) the companion matrix eigenvalue method with balancing, and (5) the Jenkens-Traub method, all of which are methods for finding the zeros of polynomials. The test set of polynomials used are those suggested by [5]. The methods were compared on each test polynomials on the basis of the accuracy of the computed roots and the CPU time required to numerically compute all roots.     

Lehmer's problem for compact Abelian groups

We formulate Lehmer's Problem concerning the Mahler measure of polynomials for general compact abelian groups, introducing a Lehmer constant for each such group. We show that all nontrivial connected compact groups have the same Lehmer constant and conjecture the value of the Lehmer constant for finite cyclic groups. We also show that if a group has infinitely many connected components, then its Lehmer constant vanishes.

     

Generalized Lucas polynomials and relationships between the Fibonacci polynomials and Lucas polynomials

In this article, we find elements of the Lucas polynomials by using two matrices. We extend the study to the n-step Lucas polynomials. Then the Lucas polynomials and their relationship are generalized in the paper. Furthermore, we give relationships between the Fibonacci polynomials and the Lucas polynomials.     

Analytical solution of polynomial equations with an application to the Quintic equation

A recently proposed method for the derivation of exact analytical integral formulae for the zeros of analytic functions (based on the simple discontinuity problem for a sectionally analytic function along the real axis) is applied here to the case of polynomials. The peculiarity of the present application is that the integrals appearing in the closed-form formulae for the sought zeros are interpreted as Cauchy-type principal-value integrals or even as finite-part integrals. The case of the quintic equation with real coefficients is considered in some detail, and it is shown that the roots of this equation can always be obtained in closed form. Numerical results for this equation are also presented. Equations of higher degree can also be solved in closed form under appropriate conditions.     

On the Complexity of Isolating Real Roots and Computing with Certainty the Topological Degree

In this contribution the isolation of real roots and the computation of the topological degree in two dimensions are considered and their complexity is analyzed. In particular, we apply Stenger's degree computational method by splitting properly the boundary of the given region to obtain a sequence of subintervals along the boundary that forms a sufficient refinement. To this end, we properly approximate the function using univariate polynomials. Then we isolate each one of the zeros of these polynomials on the boundary of the given region in various subintervals so that these subintervals form a sufficiently refined boundary.     

Do Orthogonal Polynomials Dream of Symmetric Curves?

The complex or non-Hermitian orthogonal polynomials with analytic weights are ubiquitous in several areas such as approximation theory, random matrix models, theoretical physics and in numerical analysis, to mention a few. Due to the freedom in the choice of the integration contour for such polynomials, the location of their zeros is a priori not clear. Nevertheless, numerical experiments, such as those presented in this paper, show that the zeros not simply cluster somewhere on the plane, but persistently choose to align on certain curves, and in a very regular fashion. The problem of the limit zero distribution for the non-Hermitian orthogonal polynomials is one of the central aspects of their theory. Several important results in this direction have been obtained, especially in the last 30 years, and describing them is one of the goals of the first parts of this paper. However, the general theory is far from being complete, and many natural questions remain unanswered or have only a partial explanation. Thus, the second motivation of this paper is to discuss some “mysterious” configurations of zeros of polynomials, defined by an orthogonality condition with respect to a sum of exponential functions on the plane, that appeared as a results of our numerical experiments. In this apparently simple situation the zeros of these orthogonal polynomials may exhibit different behaviors: for some of them we state the rigorous results, while others are presented as conjectures (apparently, within a reach of modern techniques). Finally, there are cases for which it is not yet clear how to explain our numerical results, and where we cannot go beyond an empirical discussion.     

Consequences of Schanuel's condition for zeros of exponential terms

Assuming “Schanuel's Condition” for a certain class of exponential fields, Sturm's technique for polynomials in real closed fields can be extended to more complicated exponential terms in the corresponding exponential field. Hence for this class of terms the exact number of zeros can be calculated. These results give deeper insights into the model theory of exponential fields. MSC: 03C65, 03C60, 12L12.     

Quadratically Convergent Method for Simultaneously Approaching the Roots of Polynomial Solutions of a Class of Differential Equations: Application to Orthogonal Polynomials

This paper investigates the application of the method introduced by L. Pasquini (1989) for simultaneously approaching the zeros of polynomial solutions to a class of second-order linear homogeneous ordinary differential equations with polynomial coefficients to a particular case in which these polynomial solutions have zeros symmetrically arranged with respect to the origin. The method is based on a family of nonlinear equations which is associated with a given class of differential equations. The roots of the nonlinear equations are related to the roots of the polynomial solutions of differential equations considered. Newton's method is applied to find the roots of these nonlinear equations. In (Pasquini, 1994) the nonsingularity of the roots of these nonlinear equations is studied. In this paper, following the lines in (Pasquini, 1994), the nonsingularity of the roots of these nonlinear equations is studied. More favourable results than the ones in (Pasquini, 1994) are proven in the particular case of polynomial solutions with symmetrical zeros. The method is applied to approximate the roots of Hermite–Sobolev type polynomials and Freud polynomials. A lower bound for the smallest positive root of Hermite–Sobolev type polynomials is given via the nonlinear equation. The quadratic convergence of the method is proven. A comparison with a classical method that uses the Jacobi matrices is carried out. We show that the algorithm derived by the proposed method is sometimes preferable to the classical QR type algorithms for computing the eigenvalues of the Jacobi matrices even if these matrices are real and symmetric.