Sciweavers

154 search results - page 2 / 31
» On the nonlinearity of linear recurrence sequences
Sort
View
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
13 years 4 months ago
Shift Equivalence of P-finite Sequences
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
Manuel Kauers
NIPS
1993
13 years 6 months ago
Mixtures of Controllers for Jump Linear and Non-Linear Plants
We describe an extension to the Mixture of Experts architecture for modelling and controlling dynamical systems which exhibit multiple modesof behavior. This extension is based on...
Timothy W. Cacciatore, Steven J. Nowlan
COMBINATORICS
2007
66views more  COMBINATORICS 2007»
13 years 4 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
BMCBI
2010
124views more  BMCBI 2010»
13 years 5 months ago
Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
Norman E. Davey, Richard J. Edwards, Denis C. Shie...
JSC
2008
96views more  JSC 2008»
13 years 4 months ago
Computing the algebraic relations of C-finite sequences and multisequences
We present an algorithm for computing generators for the ideal of algebraic relations among sequences which are given by homogeneous linear recurrence equations with constant coef...
Manuel Kauers, Burkhard Zimmermann