Results 11 to 20 of about 141,879 (256)

On dynamics and solution expressions of a three dimensional nonlinear difference equations system

open access: yesJournal of Innovative Applied Mathematics and Computational Sciences, 2023
 In this paper, we construct the solution expressions of fourth order nonlinear difference systems Φn+1       =                   Φn−2Ψn−3                       ,         α + Ψn (±1 ± Γn−1Φn−2Ψn−3) Ψn+1       =                   Ψn−2Γn−3         
Faiza Al-Rakhami, E Elsayed
doaj   +1 more source

On recursive expressions for statistics of decimated sequences

open access: yesLietuvos Matematikos Rinkinys, 2021
In what follows we introduce the recursive approach for calculating statistical moments of decimated realizations. We prove the corollaries referring to recursive calculation and present an example for any realization of 17 sample.
Rimantas Pupeikis
doaj   +1 more source

On the recursive sequence [PDF]

open access: yesApplied Mathematics and Computation, 2005
The aim of this paper is to investigate the boundedness, global asymptotic stability and periodic character of solutions of the difference equation \(x_{n+1}=(\gamma x_{n-1}+\delta x_{n-2})/(x_n+x_{n-2}), n=0,1,\dots,\) where the parameters \(\gamma\) and \(\delta\) and initial conditions are positive real numbers.
Xiaofan Yang   +4 more
  +6 more sources

On the complexity of integer polynomial recursive sequences

open access: yesИзвестия высших учебных заведений. Поволжский регион: Физико-математические науки, 2022
Background. Linear recursive sequences represent the “classic'” object of combinatorial analysis. To express an arbitrary term of a linear recursive sequence, there are exact formulas of exponential type as in the case of a field of complex numbers ...
S.S. Marchenkov
doaj   +1 more source

Recursive sequence generation in crows

open access: yesScience Advances, 2022
Recursion, the process of embedding structures within similar structures, is often considered a foundation of symbolic competence and a uniquely human capability. To understand its evolution, we can study the recursive aptitudes of nonhuman animals. We adopted the behavioral protocol of a recent study demonstrating that humans and nonhuman primates ...
Diana A. Liao   +3 more
openaire   +2 more sources

A Family of the Zeckendorf Theorem Related Identities [PDF]

open access: yes, 2015
In this paper we present a family of identities for recursive sequences arising from a second order recurrence relation, that gives instances of Zeckendorf representation.
Martinjak, Ivica
core   +1 more source

Closed paths whose steps are roots of unity [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
We give explicit formulas for the number $U_n(N)$ of closed polygonal paths of length $N$ (starting from the origin) whose steps are $n^{\textrm{th}}$ roots of unity, as well as asymptotic expressions for these numbers when $N \rightarrow \infty$.
Gilbert Labelle, Annie Lacasse
doaj   +1 more source

On Linear Difference Equations over Rings and Modules [PDF]

open access: yes, 2003
In this note we develop a coalgebraic approach to the study of solutions of linear difference equations over modules and rings. Some known results about linearly recursive sequences over base fields are generalized to linearly (bi)recursive (bi)sequences
Abuhlail, Jawad Y.
core   +8 more sources

Random recursive trees: A boundary theory approach [PDF]

open access: yes, 2014
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in terms of the input
Grübel, Rudolf, Michailow, Igor
core   +3 more sources

On Rational Recursive Sequences

open access: yesJournal of Mathematical Analysis and Applications, 1993
The present study is related to the global asymptotic behavior, the oscillatory character and the periodic nature of all solutions of the rational recursive sequences; \(x_{n+1}=[a+\sum^{k-1}_{i=0}b_ ix_{n-i}]/x_{n-k}\), and \(x_{n+1}=(a+bx_ n)/(A+x_{n-k})\), \(n=0,1,2,\dots\), which arises due to an open problem [problem \# 1343, Math., Mag. 63, No. 2,
Kocic, V.L., Ladas, G., Rodrigues, I.W.
openaire   +2 more sources

Home - About - Disclaimer - Privacy