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.     

Several polynomials associated with the harmonic numbers

We develop polynomials in z∈C for which some generalized harmonic numbers are special cases at z=0. By using the Riordan array method, we explore interesting relationships between these polynomials, the generalized Stirling polynomials, the Bernoulli polynomials, the Cauchy polynomials and the Nörlund polynomials.     

Isometries between spaces of homogeneous polynomials

We derive Banach-Stone theorems for spaces of homogeneous polynomials. We show that every isometric isomorphism between the spaces of homogeneous approximable polynomials on real Banach spaces E and F is induced by an isometric isomorphism of E^′ onto F^′. With an additional geometric condition we obtain the analogous result in the complex case. Isometries between spaces of homogeneous integral polynomials and between the spaces of all n-homogeneous polynomials are also investigated.     

Hilbert polynomials and Arveson's curvature invariant

We define and study Hilbert polynomials for certain holomorphic Hilbert spaces. We obtain several estimates for these polynomials and their coefficients. Our estimates inspire us to investigate the connection between the leading coefficients of Hilbert polynomials for invariant subspaces of the symmetric Fock space and Arveson's curvature invariant for coinvariant subspaces. We are able to obtain some formulas relating the curvature invariant with other invariants. In particular, we prove that Arveson's version of the Gauss-Bonnet-Chern formula is true when the invariant subspaces are generated by any polynomials.     

Pseudo-Orthogonal Polynomials

We consider the classical problem of transforming an orthogonality weight of polynomials by means of the space R _n . We describe systems of polynomials called pseudo-orthogonal on a finite set of n points. Like orthogonal polynomials, the polynomials of these systems are connected by three-term relations with tridiagonal matrix which is nondecomposable but does not enjoy the Jacobi property. Nevertheless these polynomials possess real roots of multiplicity one; moreover, almost all roots of two neighboring polynomials separate one another. The pseudo-orthogonality weights are partly negative. Another result is the analysis of relations between matrices of two different orthogonal systems which enables us to give explicit conditions for existence of pseudo-orthogonal polynomials.     

Intersection Alexander polynomials

By considering a (not necessarily locally-flat) PL knot as the singular locus of a PL stratified pseudomanifold, we can use intersection homology theory to define intersection Alexander polynomials, a generalization of the classical Alexander polynomial invariants for smooth or PL locally-flat knots. We show that the intersection Alexander polynomials satisfy certain duality and normalization conditions analogous to those of ordinary Alexander polynomials, and we explore the relationships between the intersection Alexander polynomials and certain generalizations of the classical Alexander polynomials that are defined for non-locally-flat knots. We also investigate the relations between the intersection Alexander polynomials of a knot and the intersection and classical Alexander polynomials of the link knots around the singular strata. To facilitate some of these investigations, we introduce spectral sequences for the computation of the intersection homology of certain stratified bundles.     

Multivariate Chebyshev polynomials in terms of singular elements

We use the direct correspondence between Weyl anti-invariant functions and multivariate second-type Chebyshev polynomials to substantially simplify most operations with multivariate polynomials. We illustrate the obtained results by studying bivariate polynomials of the second type for root systems A₁ ⊕ A₁, B₂, and G₂.     

Alternating Eulerian polynomials and left peak polynomials

We first present grammatical interpretations for the alternating Eulerian polynomials of types A and B. As applications, we then derive several properties of the type B alternating Eulerian polynomials, including recurrence relations, generating function and unimodality. And then, we establish an interesting connection between alternating Eulerian polynomials of type B and left peak polynomials, which implies that the type B alternating Eulerian polynomials have gamma-vectors that alternate in sign.     

Orlicz-Pettis Polynomials on Banach Spaces

 We introduce the class of Orlicz-Pettis polynomials between Banach spaces, defined by their action on weakly unconditionally Cauchy series. We give a number of equivalent definitions, examples and counterexamples which highlight the differences between these polynomials and the corresponding linear operators. (Received 17 May 1999; in revised form 6 October 1999)     

Bivariate Fibonacci polynomials of order <Emphasis Type="Italic">k</Emphasis> with statistical applications

In the present article, we investigate the properties of bivariate Fibonacci polynomials of order k in terms of the generating functions. For k and ℓ (1 ≤ ℓ ≤ k − 1), the relationship between the bivariate Fibonacci polynomials of order k and the bivariate Fibonacci polynomials of order ℓ is elucidated. Lucas polynomials of order k are considered. We also reveal the relationship between Lucas polynomials of order k and Lucas polynomials of order ℓ. The present work extends several properties of Fibonacci and Lucas polynomials of order k, which will lead us a new type of geneses of these polynomials. We point out that Fibonacci and Lucas polynomials of order k are closely related to distributions of order k and show that the distributions possess properties analogous to the bivariate Fibonacci and Lucas polynomials of order k.     

Computing orthogonal polynomials on a triangle by degree raising

We give an algorithm for computing orthogonal polynomials over triangular domains in Bernstein–Bézier form which uses only the operator of degree raising and its adjoint. This completely avoids the need to choose an orthogonal basis (or tight frame) for the orthogonal polynomials of a given degree, and hence the difficulties inherent in that approach. The results are valid for Jacobi polynomials on a simplex, and show the close relationship between the Bernstein form of Jacobi polynomials, Hahn polynomials and degree raising.     

q-Bernoulli polynomials and q-umbral calculus

In this paper, we investigate some properties of q-Bernoulli polynomials arising from q-umbral calculus. We find a formula for expressing any polynomial as a linear combination of q-Bernoulli polynomials with explicit coefficients. Also, we establish some connections between q-Bernoulli polynomials and higher-order q-Bernoulli polynomials.     

Geometric relations between the zeros of polynomials

We consider the classical theorem of Grace, which gives a condition for a geometric relation between two arbitrary algebraic polynomials of the same degree. This theorem is one of the basic instruments in the geometry of polynomials. In some applications of the Grace theorem, one of the two polynomials is fixed. In this case, the condition in the Grace theorem may be changed. We explore this opportunity and introduce a new notion of locus of a polynomial. Using the loci of polynomials, we may improve some theorems in the geometry of polynomials. In general, the loci of a polynomial are not easy to describe. We prove some statements concerning the properties of a point set on the extended complex plane that is a locus of a polynomial.     

Padé approximation and generalized moments

We propose studying generalized moment representations of a form in which it suffices to apply a system of orthogonal polynomials in order to procure the biorthogonality conditions in the construction of superdiagonal Padé polynomials using generalized moment representations. The algebraic polynomials in the moment representation are to be sought as the linear forms of biorthogonal polynomials. We obtain the relations between the coefficients of these linear forms and the generalized moments, and we also establish conditions for the existence and uniqueness of generalized moment representations of polynomial form. Translated fromMatematichni Metodi ta Fiziko-Mekhanichni Polya, Vol. 39, No. 2, 1996, pp. 110–115.     

On shifted Eisenstein polynomials

We study polynomials with integer coefficients which become Eisenstein polynomials after the additive shift of a variable. We call such polynomials shifted Eisenstein polynomials. We determine an upper bound on the maximum shift that is needed given a shifted Eisenstein polynomial and also provide a lower bound on the density of shifted Eisenstein polynomials, which is strictly greater than the density of classical Eisenstein polynomials. We also show that the number of irreducible degree \(n\) polynomials that are not shifted Eisenstein polynomials is infinite. We conclude with some numerical results on the densities of shifted Eisenstein polynomials.     

Euler Pseudoprime Polynomials and Strong Pseudoprime Polynomials

It is usual to emphasize the analogy between the integers and polynomials with coefficients in a finite field, comparing different notions in the two points of view. We introduce a particular rank one Drinfeld module to get an exponentiation for polynomials and then define the notions of Euler pseudoprimes and strong pseudoprimes for polynomials with coefficients in a finite field. As for the integers, we have Solovay–Strassen and Miller–Rabin tests for polynomials.     

On the theory of the matching polynomial

In this paper we report on the properties of the matching polynomial α(G) of a graph G. We present a number of recursion formulas for α(G), from which it follows that many families of orthogonal polynomials arise as matching polynomials of suitable families of graphs. We consider the relation between the matching and characteristic polynomials of a graph. Finally, we consider results which provide information on the zeros of α(G).     

Eulerian pairs and Eulerian recurrence systems

In this paper, we introduce the definitions of Eulerian pair and Hermite-Biehler pair. We also characterize a duality relation between Eulerian recurrences and Eulerian recurrence systems. This generalizes and unifies Hermite-Biehler decompositions of several enumerative polynomials, including up-down run polynomials for symmetric groups, alternating run polynomials for hyperoctahedral groups, flag descent polynomials for hyperoctahedral groups and flag ascent-plateau polynomials for Stirling permutations. We derive some properties of associated polynomials. In particular, we prove the alternatingly increasing property and the interlacing property of the ascent-plateau and left ascent-plateau polynomials for Stirling permutations.     

On a multivariable extension for the extended Jacobi polynomials

The main object of this paper is to construct a systematic investigation of a multivariable extension of the extended Jacobi polynomials and give some relations for these polynomials. We derive various families of multilinear and multilateral generating functions. We also obtain relations between the polynomials extended Jacobi polynomials and some other well-known polynomials. Other miscellaneous properties of these general families of multivariable polynomials are also discussed. Furthermore, some special cases of the results are presented in this study.     

Factorizations of tropical and sign polynomials

In this text, we study factorizations of polynomials over the tropical hyperfield and the sign hyperfield, which we call tropical polynomials and sign polynomials, respectively. We classify all irreducible polynomials in either case. We show that tropical polynomials factor uniquely into irreducible factors, but that unique factorization fails for sign polynomials. We describe division algorithms for tropical and sign polynomials by linear terms that correspond to roots of the polynomials.