A note on the system of linear recurrence equations

Vladimir Baltic

doi:10.2298/fil1410141b

A note on the system of linear recurrence equations

Filomat ◽

10.2298/fil1410141b ◽

2014 ◽

Vol 28 (10) ◽

pp. 2141-2147

Author(s):

Vladimir Baltic

Keyword(s):

Linear Recurrence ◽

Recurrence Equations ◽

Restricted Permutations

We will find a solution to a system of 2d linear recurrence equations. Each equation is of the form x2k(n+1)=xk(n) or x2k+1(n + 1)=xk(n)+x2d-1+k(n). This kind of system is connected with counting restricted permutations.

Download Full-text

Asymptotic Behavior of a System of Higher Order Linear Recurrence Equations*

New Developments in Difference Equations and Applications ◽

10.1201/9780203745854-23 ◽

2017 ◽

pp. 323-334 ◽

Cited By ~ 1

Author(s):

MlhÁly Pituk

Keyword(s):

Asymptotic Behavior ◽

Higher Order ◽

Linear Recurrence ◽

Order Linear ◽

Recurrence Equations

Download Full-text

Denominator bounds for higher order systems of linear recurrence equations

ACM Communications in Computer Algebra ◽

10.1145/3055282.3055298 ◽

2017 ◽

Vol 50 (4) ◽

pp. 185-187

Author(s):

Johannes Middeke ◽

Carsten Schneider

Keyword(s):

Higher Order ◽

Linear Recurrence ◽

Recurrence Equations

Download Full-text

Finite singularities and hypergeometric solutions of linear recurrence equations

Journal of Pure and Applied Algebra ◽

10.1016/s0022-4049(99)00008-0 ◽

1999 ◽

Vol 139 (1-3) ◽

pp. 109-131 ◽

Cited By ~ 45

Author(s):

Mark van Hoeij

Keyword(s):

Linear Recurrence ◽

Recurrence Equations ◽

Hypergeometric Solutions

Download Full-text

The mapping of linear recurrence equations on regular arrays

The Journal of VLSI Signal Processing Systems for Signal Image and Video Technology ◽

10.1007/bf02477176 ◽

1989 ◽

Vol 1 (2) ◽

pp. 95-113 ◽

Cited By ~ 128

Author(s):

Patrice Quinton ◽

Vincent van Dongen

Keyword(s):

Linear Recurrence ◽

Recurrence Equations ◽

Regular Arrays

Download Full-text

Search for Liouvillian solutions of linear recurrence equations in the MAPLE computer algebra system

Programming and Computer Software ◽

10.1134/s0361768808040038 ◽

2008 ◽

Vol 34 (4) ◽

pp. 204-209 ◽

Cited By ~ 3

Author(s):

D. E. Khmelnov

Keyword(s):

Computer Algebra ◽

Computer Algebra System ◽

Linear Recurrence ◽

Recurrence Equations ◽

Liouvillian Solutions

Download Full-text

m-Fold Hypergeometric Solutions of Linear Recurrence Equations Revisited

Mathematics in Computer Science ◽

10.1007/s11786-012-0107-8 ◽

2012 ◽

Vol 6 (1) ◽

pp. 61-77 ◽

Cited By ~ 7

Author(s):

Peter Horn ◽

Wolfram Koepf ◽

Torsten Sprenger

Keyword(s):

Linear Recurrence ◽

Recurrence Equations ◽

Hypergeometric Solutions

Download Full-text

Analytical calculation of the deflection of an externally statically indeterminate lattice truss

MATEC Web of Conferences ◽

10.1051/matecconf/201926505027 ◽

2019 ◽

Vol 265 ◽

pp. 05027

Author(s):

Mikhail Kirsanov ◽

Evgeny Komerzan ◽

Olesya Sviridenko

Keyword(s):

Arbitrary Number ◽

Analytical Calculation ◽

Linear Recurrence ◽

System Of Equations ◽

Induction Method ◽

Particular Solutions ◽

Recurrence Equations ◽

Nonmonotonic Character

A scheme of a statically definable truss with additional supports is proposed. Derive formulas for the dependence of the deflection of the truss against the number of panels for three types of symmetrical loads. It is shown that for definite numbers of panels the determinant of the system of equations for the equilibrium of nodes degenerates. This indicates an instant changeability of the structure. To generalize particular solutions to an arbitrary number of panels, the induction method is applied. For this purpose, in the computer mathematics system Maple linear recurrence equations are constructed for the terms of a sequence of coefficients from individual solutions. The graphs of the dependences obtained indicate a nonmonotonic character of the solutions found and the possibility of optimizing the design by choosing the number of panels.

Download Full-text