We introduce a novel fourth order linear recurrence sequence {Sn} using the two periodic binary recurrence. We call it “pellans sequence” and then we solve the system ab+ 1 = Sx, ac + 1 = Sy bc+ 1 = Sz where a < b < c are positive integers. Therefore, we extend the order of recurrence sequence for this variant diophantine equations by means of pellans sequence.

The main aim of this paper is to construct a multivariable extension with the help of the extended Jacobi matrix polynomials (EJMPs). Generating matrix functions and recurrence relations satisfied by these multivariable matrix polynomials are derived. Furthermore, general families of multilinear and multilateral generating matrix functions are obtained and their applications are presented.

The Fibonomial coe¢ cients are known as interesting generalization of binomial coe¢ cients. In this paper, we derive a (k + 1)th recurrence relation and generating matrix for the Fibonomial coe¢ cients, which we call generalized Fibonomial matrix. We …nd a nice relationship between the eigenvalues of the Fibonomial matrix and the generalized right-adjusted Pascal matrix that they have the same ...

Abstract. We study a one-parameter family of countably piecewise linear interval maps, which, although Markov, fail the ‘large image property’. This leads to conservative as well as dissipative behaviour for different maps in the family with respect to Lebesgue. We investigate the transition between these two types, and study the associated thermodynamic formalism, describing in detail the seco...

We formulate a linear difference equation which yields averaged semi-inclusive decay rates for arbitrary, not necessarily large, values of the masses. We show that the rates for decays M → m+M ′ of typical heavy open strings are independent of the masses M and m, and compute the “mass deffect” M−m−M ′. For closed strings we find decay rates proportional to Mm(1−D)/2 R , wheremR is the reduced m...

whenever (un) ∞ n=0 is a non-degenerate linear recurrence sequence. Mahler’s proof is not effective in the following sense. Given a positive integer m the proof does not yield a number C(m) which is effectively computable in terms of m, such that |un| > m whenever n > C(m). However, Schmidt [31, 32], Allen [1], and Amoroso and Viada [2] have given estimates in terms of t only for the number of ...

For any integer m let P (m) denote the greatest prime factor of m and let Q(m) denote the greatest square free factor of m with the convention that P (0) = P (±1) = 1 = Q(±1) = Q(0). Thus, if m = p1 1 · · · p hr r with p1, . . . , pr distinct primes and h1, . . . , hr positive integers, then Q(m) = p1 · · · pr. van der Poorten and Schlickewei [6] and Evertse [1] proved, by means of a p-adic ver...

In this study, we introduce new matrix poynomials and derive their properties such as explict representations, recurrence relations and generating matrix functions. 2010 Mathematics Subject Classification: 33C45; 15A60

The second order linear difference equation (1) ∆(rk∆xk) + ckxk+1 = 0, where rk 6= 0 and k ∈ , is considered as a special type of symplectic systems. The concept of the phase for symplectic systems is introduced as the discrete analogy of the Bor̊uvka concept of the phase for second order linear differential equations. Oscillation and nonoscillation of (1) and of symplectic systems are investiga...