Abstract
A C-finite sequence is a sequence satisfying a linear recurrence equation with constant coefficients. While it is trivial to multiply two C-finite sequences (just like integers), it is not quite so trivial to “factorize” them, or to decide whether they are “prime”. Here we address these problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ekhad, S.B., Zeilberger, D.: Automatic generation of generating functions for enumerating matchings. Personal Journal of Shalosh B. Ekhad and Doron Zeilberger, April 29, 2011. http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/shidukhim.html
Greene, C., Wilf, H.S.: Closed form summation of C-finite sequences. Trans. Am. Math. Soc. 359, 1161–1189 (2007). math/0405574
Hirschhorn, M.D.: A proof in the spirit of Zeilberger of an amazing identity of Ramanujan. Math. Mag. 4, 267–269 (1996)
Hou, Q.-H., Xin, G.: Constant term evaluation for summation of C-finite sequences. In: DMTCS Proc. AN, pp. 761–772 (2010)
Kasteleyn, P.W.: The statistics of dimers on a lattice, I: the number of dimer arrangements in a quadratic lattice. Physica 27, 1209–1225 (1961)
Kauers, M.: SumCracker: a package for manipulating symbolic sums and related objects. J. Symb. Comput. 41, 1039–1057 (2006). http://www.risc.uni-linz.ac.at/people/mkauers/publications/kauers06h.pdf
Kauers, M., Paule, P.: The Concrete Tetrahedron. Springer, Berlin (2011)
Kauers, M., Zimmermann, B.: Computing the algebraic relations of C-finite sequences and multisequences. J. Symb. Comput. 43, 787–803 (2008)
Onsager, L.: Crystal statistics, I. A two-dimensional model with an order-disorder transition. Phys. Rev. 65, 117–149 (1944)
Sellers, J.A.: Domino tilings and products of Fibonacci and Pell numbers. J. Integer Seq. 5, 02.1.2 (2002). http://www.cs.uwaterloo.ca/journals/JIS/VOL5/Sellers/sellers4.pdf
Shapiro, L.: A combinatorial proof of a Chebyshev polynomial identity. Discrete Math. 34, 203–206 (1981)
Stanley, R.: Differentiably finite power series. Eur. J. Comb. 1, 175–188 (1980). http://www.math.mit.edu/~rstan/pubs/pubfiles/45.pdf
Stanley, R.: Enumerative Combinatorics, vol. 1. Wadsworth and Brooks/Cole, Pacific Grove (1986). Second printing, Cambridge University Press, Cambridge, 1996
Temperley, H., Fisher, M.: Dimer problems in statistical mechanics—an exact result. Philos. Mag. 6, 1061–1063 (1961)
Zeilberger, D.: A holonomic systems approach to special functions. J. Comput. Appl. Math. 32, 321–368 (1990). http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimPDF/holonomic.pdf
Zeilberger, D.: An enquiry concerning human (and computer!) [mathematical] understanding. In: Calude, C.S. (ed.) Randomness and Complexity, from Leibniz to Chaitin. World Scientific, Singapore (2007). http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/enquiry.html
Zeilberger, D.: Automatic CounTilings, Personal Journal of Shalosh B. Ekhad and Doron Zeilberger, January 20, 2006; also published in Rej. Math. 1, 10–17 (2009). http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/tilings.html
Zeilberger, D.: Opinion 89: Mental Math Whiz [And Very Good Mathematician] Art Benjamin Should be Aware that not only his Night Job, but also some parts of his “Day Job” should be clearly labeled “For Entertainment Only”. http://www.math.rutgers.edu/~zeilberg/Opinion89.html
Acknowledgement
I’d like to thank the referees for their insightful remarks and minor corrections.
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated with friendship and admiration to Mourad Ismail and Dennis Stanton
Supported in part by the NSF.
Accompanied by Maple package Cfinite downloadable from http://www.math.rutgers.edu/~zeilberg/tokhniot/Cfinite.
Rights and permissions
About this article
Cite this article
Zeilberger, D. The C-finite ansatz. Ramanujan J 31, 23–32 (2013). https://doi.org/10.1007/s11139-012-9406-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11139-012-9406-6