机译:最大类型差异方程x_ {n} = max { frac {A_1} {x ^ { alpha_1} _ {n-m_1}}, frac {A_2} {x ^ { alpha_2} _ {n-m_2}}, cdots, frac {A_k} {x ^ { alpha_k} _ {n-m_k}} }
机译:关于最大类型差分方程(x_ {k + 1})= max { frac {1} {x_ {k-1} ^ {n}},x_ {k-1} ^ n}}的解, n geq 1
机译:最终定期的模糊最大差分(x_ {n} = max {c, frac {x_ {n-m-k}} {x_ {n-m}} )
机译:差分方程$ x_ {n + 1} = frac {ax_ {n-3}} {b + cx_ {n-1} x_ {n-3}} $的整体行为
机译:最终定期的模糊最大差分方程$ x_ {n} = max {c, frac {x_ {n-m-k}} {x_ {n-m}} } $