We introduce the notions of unsigned and signed generalized Lucas sequences and prove certain polynomial recurrence relations on their characteristic polynomials. We also characterize when these characteristic polynomials are irreducible polynomials over a finite field. Moreover, we obtain the explicit expressions of the remainders of Dickson polynomials of the first kind divided by the charact...

for every $1leq s< n$, the $s^{th}$ derivative of a polynomial $p(z)$ of degree $n$ is a polynomial $p^{(s)}(z)$ whose degree is $(n-s)$. this paper presents a result which gives generalizations of some inequalities regarding the $s^{th}$ derivative of a polynomial having zeros outside a circle. besides, our result gives interesting refinements of some well-known results.

in this paper, the concept of canonical representation is proposed to find fuzzy roots of fuzzy polynomial equations. we transform fuzzy polynomial equations to system of crisp polynomial equations, this transformation is perform by using canonical representation based on three parameters value, ambiguity and fuzziness.

The cameracentered motion representation is ([1][5][6]): This paper presents two algorithms for estimating motion and structure from long monocular image sequences: one using interframe correspondences, the other using point trajectories. Object-centered motion represenfations and motion models &scribed by up to the second order polynomials are used to estimate motion parameters from long image...

We prove a formula for the linearization coefficients of the general Sheffer polynomials, which unifies all the special known results for Hermite, Charlier, Laguerre, Meixner and MeixnerPollaczek polynomials. Furthermore, we give a new and explicit real version of the corresponding formula for Meixner-Pollaczek polynomials. Our proof is based on some explicit bijections and sign-reversing weigh...

Visontai conjectured in 2013 that the joint distribution of ascent and distinct nonzero value numbers on the set of subexcedant sequences is the same as that of descent and inverse descent numbers on the set of permutations. This conjecture has been proved by Aas in 2014, and the generating function of the corresponding bistatistics is the double Eulerian polynomial. Among the techniques used b...

Graham and Lovász conjectured in 1978 that the sequence of normalized coefficients distance characteristic polynomial a tree order n is unimodal with maximum value occurring at ⌊n2⌋. In this paper we investigate problem for block graphs. particular, prove unimodality part establish peak several extremal cases uniform graphs small diameter.

In the present paper, we study the class LPn which consists of Laurent polynomials P (z) = (n+ 1) + n ∑ k=1 k – odd ck(z k + z−k), with all coefficients ck equal to −1 or 1. Such polynomials arise in the study of Barker sequences of even length — binary sequences with minimal possible autocorrelations. By using an elementary (but not trivial) analytic argument, we prove that polynomials Rn(z) w...

Abstract. We give two new expressions of subresultants, nested subresultant and reduced nested subresultant, for the recursive polynomial remainder sequence (PRS) which has been introduced by the author. The reduced nested subresultant reduces the size of the subresultant matrix drastically compared with the recursive subresultant proposed by the authors before, hence it is much more useful for...

Let P (x) ∈ Z[x] be an integer-valued polynomial taking only positive values and let d be any fixed positive integer. The aim of this short note is to show, by elementary means, that for any sufficiently large integer N ≥ N0(P, d) there exists n such that P (n) contains exactly N occurrences of the block (q − 1, q − 1, . . . , q − 1) in its digital expansion in base q. The method of proof is co...