NA
2010
13 years 11 months ago
2010
Abstract: In this work we give an interpretation of a (s(d + 1) + 1)-term recurrence relation in terms of type II multiple orthogonal polynomials. We rewrite this recurrence relati...
AAECC
1998
Springer
14 years 5 days ago
1998
Springer
The set of all linear recurrence relations satisfied by given sequences of finite length is described by the annihilator ideal of the sequences. The MasseyDing algorithm to compu...
INFORMATICALT
2007
14 years 11 days ago
2007
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
COMBINATORICS
2007
14 years 13 days ago
2007
We show that the generating function (in n) for the number of walks on the square lattice with steps (1, 1), (1, −1), (2, 2) and (2, −2) from (0, 0) to (2n, 0) in the region 0...
ENTCS
2006
14 years 14 days ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
DM
2008
14 years 16 days ago
2008
Riordan paths are Motzkin paths without horizontal steps on the x-axis. We establish a correspondence between Riordan paths and (321, 3