This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
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...
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...
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...
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...
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...