in this paper we intend to offer new numerical methods to solve the second-order fuzzy abel-volterraintegro-differential equations under the generalized $h$-differentiability. the existence and uniqueness of thesolution and convergence of the proposed methods are proved in details and the efficiency of the methods is illustrated through a numerical example.

where m ∈ Z. We are interested in these operators as linear operators on a special ring of polynomials, discussed in [5], namely, the ring of isobaric polynomials Λ̃, a ring isomorphic to the ring of symmetric functions Λ. The polynomials in Λ̃, or more precisely Λ̃k, are over indeterminants t1, . . . , tk and the isomorphism just mentioned is given by identifying tj with the signed elementary sym...

In this paper we give a new generalization of the Lucas numbers in matrix representation. Also we present a relation between the generalized order-k Lucas sequences and Fibonacci sequences. 2003 Elsevier Inc. All rights reserved.

In this paper, we introduce a tiling approach to (p,q)-Fibonacci and (p,q)-Lucas numbers that generalize of the well-known Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal ve Jacobsthal-Lucas numbers. We show nth number is interpreted as ways tile 1×n board with cells labeled 1,2,...,n using colored 1×1 squares 1×2 dominoes, where there are p kind colors for q dominoes. Then circular also present...

In this study, we define a generalization of Lucas sequence {pn}. Then we obtain Binet formula of sequence {pn} . Also, we investigate relationships between generalized Fibonacci and Lucas sequences.

ZM^fi-V—^yy"^ (»*l) (1.D j=o " A J ) in the indeterminate^, where the symbol [ • J denotes the greatest integer function. It can be seen that z n = b W . l ) ("even), \y-pn(yA) (Koddand^O), where pn(y, 1) are the Dickson polynomials iny with the parameter c = 1 (e.g., see (1.1) of [1]). Because of the relation (1.2), the quantities Zn(y) will be referred to as modified Dickson polynomials. Info...

The aim of this paper is to give new results about factorizations of the Fibonacci numbers Fn and the Lucas numbers Ln. These numbers are defined by the second order recurrence relation an+2 = an+1+an with the initial terms F0 = 0, F1 = 1 and L0 = 2, L1 = 1, respectively. Proofs of theorems are done with the help of connections between determinants of tridiagonal matrices and the Fibonacci and ...

A characterization is given of the sequences {"fyj^o vvith the property that, for any complex polynomial/(z) = 1akzk and convex region Kcontaining the origin and the zeros of/, the zeros of 2 y¡<akzk again lie in K. Many applications and related results are also given. This work leads to a study of the Taylor coefficients of entire functions of type I in the Laguerre-Pólya class. If the power s...

The aim of this paper is to construct general forms ordinary generating functions for special numbers and polynomials involving Fibonacci type polynomials, Lucas Chebyshev Sextet Humbert-type chain anti-chain rank the lattices, length any alphabet words, partitions, other graph polynomials. By applying Euler transform Lambert series these functions, many new identities relations are derived. us...

This paper is concerned with a class of linear operators acting in the space of the trigonometric polynomials and preserving the inequalities of the form \S(8)\ < \T(8)\ in the half plane Im 8 > 0. Some inequalities for entire functions of exponential type and some theorems concerning the distribution of the zeros of the trigonometric polynomials, including an analogue to the Gauss-Lucas theore...