On the recursive sequence \(x_{n+1} = \max \left\{ c, \frac {x_n^p}{x_{n-1}^p} \right\}\) (Q953877): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.aml.2007.08.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W66904890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A difference equation with eventually periodic solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On positive solutions of a reciprocal difference equation with minimum / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the eventual periodicity of with a period-four parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reciprocal difference equation with maximum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4129176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the recursive sequence \(x_{n+1}=\frac{A}{\prod^ k_{i=0}x_{n-i}}+\frac{1}{\prod^{2(k+1)}_{j=k+2}x_{n-j}}\). / rank
 
Normal rank

Latest revision as of 19:55, 28 June 2024

scientific article
Language Label Description Also known as
English
On the recursive sequence \(x_{n+1} = \max \left\{ c, \frac {x_n^p}{x_{n-1}^p} \right\}\)
scientific article

    Statements

    On the recursive sequence \(x_{n+1} = \max \left\{ c, \frac {x_n^p}{x_{n-1}^p} \right\}\) (English)
    0 references
    0 references
    6 November 2008
    0 references
    This work studies the boundedness and global attractivity for the posivitive solutions of the difference equation \(x_{n+1}= \max\{c,{x^p_n\over x^p_{n-1}}\}\), \(n\in\mathbb{N}_0\) with \(p,c\in(0,+\infty)\). It is shown that: (a) there exist unbounded solutions whenever \(p\geq 4\); (b) all positive solutions are bounded when \(p\in(0, 4)\); (c) every positive solution is eventually equal to 1 when \(p\in(0, 4)\) and \(c\geq 1\); (d) all positive solutions converge to 1 whenever \(p,c\in(0,1)\).
    0 references
    0 references
    max type difference equations
    0 references
    boundedness
    0 references
    difference equation
    0 references
    global attractivity
    0 references

    Identifiers