Everything about Constant-recursive sequence

🧭 Start here: a 6-step reading path

1. Read the overview: Constant-recursive sequenceA 5-minute orientation
2. Pick up a classic book: Java software solutionsThe most-reprinted book on the subject
3. Read the landmark paper: Recursive construction of a sequence of solutions to homogeneous linear partial differential equations with constant coefficientsCited 3 times
4. Go sideways: P-recursive equationA closely related topic
5. Go sideways: Low-discrepancy sequenceA closely related topic

🏆 Landmark papers (most cited)

• Recursive construction of a sequence of solutions to homogeneous linear partial differential equations with constant coefficients

  H.L. Janssen · 1987 · Journal of Computational and Applied Mathematics · 3 citations

📚 Books worth reading

• Java software solutionsLewis, John, John E. Lewis Ph. D. · 1997
• C How to ProgramPaul J. Deitel, Harvey M. Deitel · 2007
• Signals and SystemsAlan V. Oppenheim, Alan S. Willsky · 1983
• Data structures & algorithms in JavaRobert Lafore · 2003
• Clojure high performance programmingShantanu Kumar · 2013
• Sequences and their ApplicationsT. Helleseth · 2001
• Data structures using C++D. S. Malik · 2010
• Recursive Methods in Economic DynamicsNancy L. Stokey, Robert E. Lucas, Jr. · 1989

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• P-recursive equation In mathematics a P-recursive equation is a linear equation of sequences where the coefficient sequences can be represented as polynomials. P-recursive…
• Low-discrepancy sequence In mathematics, a low-discrepancy sequence is a sequence with the property that for all values of N {\displaystyle N} , its subsequence x 1 , … , x N {\displays…
• Primitive recursive arithmetic Primitive recursive arithmetic (PRA) is a quantifier-free formalization of the natural numbers. It was first proposed by Norwegian mathematician Skolem…
• Eulerian number In combinatorics, the Eulerian number A ( n , k ) {\textstyle A(n,k)} is the number of permutations of the numbers 1 to n {\textstyle n} in which exactly…
• Holonomic function In mathematics, and more specifically in analysis, a holonomic function is a smooth function of several variables that is a solution of a system of linear…
• Block Wiedemann algorithm The block Wiedemann algorithm for computing kernel vectors of a matrix over a finite field is a generalization by Don Coppersmith of an algorithm due to…
• Skolem problem Unsolved problem in mathematics Is there an algorithm to test whether a constant-recursive sequence has a zero? More unsolved problems in mathematics In…
• Skolem arithmetic In mathematical logic, Skolem arithmetic is the first-order theory of the natural numbers with multiplication, named in honor of Thoralf Skolem. The signature…