Boundedness properties of the difference equation x n+1=(α+βx n +δx n−2)/(x n−1)

Consider the third-order difference equation x _n+1 = (α+βx _n +δx _n ? 2)/(x _n ? 1) with α ∈ [0,∞) and β,δ ∈ (0,∞). It is shown that this difference equation has unbounded solutions if and only if δ>β.     

A Note on the Difference Equation x n +1 = ∑ i =0 k α i x n − i p i

In this note we improve Theorem 2 in Ref. [3] , about the difference equation x n +1 = ~ i =0 k f i x n m i p i , n =0,1,2,..., where k is a positive integer, f i , p i ] (0, X ) for i =0,..., k , and the initial conditions x m k , x m k +1 ,..., x 0 are arbitrary positive numbers.     

On the Behavior of Solutions of x n+1 = p+(x n−1/xn )

Our goal in this article is to complete the study of the behavior of solutions of the equation in the title when the parameter p is positive and the initial conditions are arbitrary positive numbers. Our main focus is the case 0 < p < 1. We will show that in this case, all solutions which do not monotonically converge to the equilibrium have a subsequence which converges to p and a subsequence which diverges to infinity. For the sake of completeness, we will also present the results (which were previously known) with alternative proofs for the case p = 1 and the case p > 1.     

More on the Difference Equation y n + 1 = ( p + y n −1 )/( qy n + y n −1 )

From previous studies of the equation in the title with positive parameters p and q and positive initial conditions we know that if q h 4 p + 1 then the equilibrium is a global attractor. We also know that if q > 4 p + 1 then every solution eventually enters and remains in the interval [ p / q , 1]. In this strip there exists a "unique" prime period two solution that is locally asymptotically stable. In this paper, we provide more insight as to the behavior of solutions of the equation in the title in the strip [ p / q , 1], where a one-dimensional stable manifold lives.     

On the recursive sequencex n +1=α-(x n /x n −1)

We study the global asymptotic stability, global attractivity, boundedness character, and periodic nature of all positive solutions and all negative solutions of the difference equation $$x_{n + 1} = \alpha - \frac{{x_n }}{{x_{n - 1} }}, n = 0,1,...,$$ where α∈R is a real number, and the initial conditionsx?1,x ₀ are arbitrary real numbers.     

On Globally Periodic Solutions of the Difference Equation x n + 1 = f ( x n )/ x n − 1

We study the second-order difference equation x n +1 = f ( x n ) x n m 1 where f ] C 1 ([0, X ),[0, X )) and x n ] (0, X ) for all n ] Z . For the cases p h 5, we find necessary and sufficient conditions on f for all solutions to be periodic with period p . We answer some questions and conjectures of Kulenovi ' and Ladas.     

On the Diophantine Equations (2 n − 1)(6 n − 1) = x 2 and (a n − 1)(a kn − 1) = x 2

In this paper we prove that the equation (2 ⁿ – 1)(6 ⁿ – 1) = x ² has no solutions in positive integers n and x. Furthermore, the equation (a ⁿ – 1) (a ^kn – 1) = x ² in positive integers a > 1, n, k > 1 (kn > 2) and x is also considered. We show that this equation has the only solutions (a,n,k,x) = (2,3,2,21), (3,1,5,22) and (7,1,4,120).     

Global Behavior of Solutions of x n + 1 = max {x n , A}/x n x n – 1

We investigate the asymptotic behavior, the oscillatory character, and theperiodic nature of solutions of the difference equation

Linking (n − 2)-dimensional panels inn-space I: (k − 1,k)-graphs and (k − 1,k)-frames

A (k – 1,k)-graph is a multi-graph satisfyinge (k – 1)v – k for every non-empty subset ofe edges onv vertices, with equality whene = |E(G)|. A (k – 1,k)-frame is a structure generalizing an (n – 2, 2)-framework inn-space, a structure consisting of a set of (n – 2)-dimensional bodies inn-space and a set of rigid bars each joining a pair of bodies using ball joints. We prove that a graph is the graph of a minimally rigid (with respect to edges) (k – 1,k)-frame if and only if it is a (k – 1,k)-graph. Rigidity here means infinitesimal rigidity or equivalently statical rigidity.     

On the diophantine equation x 2 + p 2k = y n

Let 2 ≤ p < 100 be a rational prime and consider equation (3) in the title in integer unknowns x, y, n, k with x > 0, y > 1, n ≥ 3 prime, k ≥ 0 and gcd(x, y) = 1. Under the above conditions we give all solutions of the title equation (see the Theorem). We note that if in (3) gcd(x, y) = 1, our Theorem is an extension of several earlier results [15], [27], [2], [3], [5], [23]. Received: 25 April 2008     

Zolotarev's first problem — the best approximation by polynomials of degree ≤n − 2 tox n − nσx n−1 in [−1, 1]

Chebyshev determined $$\mathop {\min }\limits_{(a)} \mathop {\max }\limits_{ - 1 \le x \le 1} |x^n + a_1 x^{n - 1} + \cdots + a_n |$$ as 2^1?n , which is attained when the polynomial is 2^1?n T _n(x), whereT _n(x) = cos(n arc cosx). Zolotarev's First Problem is to determine $$\mathop {\min }\limits_{(a)} \mathop {\max }\limits_{ - 1 \le x \le 1} |x^n - n\sigma x^{n - 1} + a_2 x^{n - 2} + \cdots + a_n |$$ as a function ofn and the parameter σ and to find the extremal polynomials. He solved this in 1878. Another discussion was given by Achieser in 1928, and another by Erdös and Szegö in 1942. The case when 0≤|σ|≤ tan²(π/2n) is quite simple, but that for |σ|> tan²(π/2n) is quite different and very complicated. We give two new versions of the proof and discuss the change in character of the solution. Both make use of the Equal Ripple Theorem.     

On the Diophantine equation x 2 − kxy + y 2 − 2 n = 0

In this study, we determine when the Diophantine equation x ²?kxy+y ²?2 ⁿ = 0 has an infinite number of positive integer solutions x and y for 0 ? n ? 10. Moreover, we give all positive integer solutions of the same equation for 0 ? n ? 10 in terms of generalized Fibonacci sequence. Lastly, we formulate a conjecture related to the Diophantine equation x ² ? kxy + y ² ? 2 ⁿ = 0.     

On the Periodic Structure of Delayed Difference Equations of the Form x n = f ( x n − k ) on I and S 1

The aim of this paper is to give an account of some results recently obtained in Combinatorial Dynamics and apply them to get for k S 2 the periodic structure of delayed difference equations of the form x n = f ( x n m k ) on I and S 1 .