Recurrence quantification analysis (RQA)was used to analyse force signals during sustained sub-maximal grip contraction (SSGC) of three types of patients suffering from a metabolic muscle disorder (glycogen storage disease type III (GSD III), glycogen storage disease type V (GSD V) andmitochondrial myopathies (MITO)) compared to control subjects. Recurrence plots (RP) of patients showed clear n...

This paper closes an algorithmic problem of summing a set of mutual recurrence relations with constant coefficients. Given an order d system of the form A(n) = ∑d i=1 MiA(n− i)+G(n), where A,G : N→ Km and M1, . . . ,Md ∈Mm(K) for some field K and natural number m, this algorithm computes the sum ∑n i=0 A(i) as a K-linear combination of A(n), . . . , A(n − d), the initial conditions and sums of ...

This paper discusses analysis of recursive problems. It delves first on their classification, and then the various methods of solving them, depending on which class the recursive relation belongs to. An improvement on the Master Method is then described and used to demonstrate how this method is used to solve recursive relations on Divide & Conquer problems. The revised method is found easier t...

Somos 4 sequences are a family of sequences defined by a fourthorder quadratic recurrence relation with constant coefficients. For particular choices of the coefficients and the four initial data, such recurrences can yield sequences of integers. Fomin and Zelevinsky have used the theory of cluster algebras to prove that these recurrences also provide one of the simplest examples of the Laurent...

In 1858, Stern introduced an array, later called the diatomic array. The array is formed by taking two values a and b for the first row, and each succeeding row is formed from the previous by inserting c+d between two consecutive terms with values c, d. This array has many interesting properties, such as the largest value in a row of the diatomic array is the (r + 2)-th Fibonacci number, occurr...

This paper will prove that essentially only the obvious recurrences have almost all primes as divisors. An integer n is a divisor of a recurrence if n divides some term of the recurrence. In this paper, "almost all primes" will be taken interchangeably to mean either all but finitely many primes or all but for a set of Dirichlet density zero in the set of primes. In the context of this paper, t...

Using integration by parts relations, Feynman integrals can be represented in terms of coupled systems of differential equations. In the following we suppose that the unknown Feynman integrals can be given in power series representations, and that sufficiently many initial values of the integrals are given. Then there exist algorithms that decide constructively if the coefficients of their powe...

ABSTRACT We consider systems Al(t)y(q t)+ . . . +A0(t)y(t) = b(t) of higher order q-recurrence equations with rational coecients. We extend a method for €nding a bound on the maximal power of t in the denominator of arbitrary rational solutionsy(t) aswell as amethod for bounding the degree of polynomial solutions from the scalar case to the systems case. Œe approach is direct and does not rely...

In this article, we present a general solution for linear divide-and-conquer recurrences of the form

we introduce a matricial toeplitz transform and prove that the toeplitz transform of a second order recurrence sequence is another second order recurrence sequence. we investigate the injectivity of this transform and show how this distinguishes the fibonacci sequence among other recurrence sequences. we then obtain new fibonacci identities as an application of our transform.