Sciweavers

1029 search results - page 2 / 206
» Probabilistic Recurrence Relations
Sort
View
DAM
2008
101views more  DAM 2008»
13 years 7 months ago
Three Hoppy path problems and ternary paths
In this paper we solve several recurrence relations with two (three) indices using combinatorial methods. Moreover, we present several recurrence relations with two (three) indice...
Eva Yu-Ping Deng, Toufik Mansour
COMBINATORICS
2007
66views more  COMBINATORICS 2007»
13 years 7 months ago
The Number of [Old-Time] Basketball Games with Final Score n: n where the Home Team was Never Losing but also Never Ahead by Mor
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...
Arvind Ayyer, Doron Zeilberger
AAECC
1998
Springer
88views Algorithms» more  AAECC 1998»
13 years 7 months ago
A Generalization of the Massey-Ding Algorithm
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...
Joachim Althaler, Arne Dür
ADCM
2007
113views more  ADCM 2007»
13 years 7 months ago
Asymptotic behavior of solutions of general three term recurrence relations
We consider the solutions of general three term recurrence relations whose coefficients are analytic functions in a prescribed region. We study the ratio asymptotic of such soluti...
D. Barrios Rolanía, Guillermo López ...
MOC
2002
136views more  MOC 2002»
13 years 7 months ago
Automatic reduction of elliptic integrals using Carlson's relations
In a series of papers, B. C. Carlson produced tables of elliptic integrals, evaluating them in terms of easily computed symmetrical functions, using a group of multivariate recurre...
Norman Gray