Alin Bostan
ABSTRACT
We address the question of computing one selected term of an algebraic power series. In characteristic zero, the best algorithm currently known for computing the~Nth coefficient of an algebraic series uses differential equations and has arithmetic complexity quasi-linear in √N. We show that over a prime field of positive characteristic p, the complexity can be lowered to O(log N). The mathematical basis for this dramatic improvement is a classical theorem stating that a formal power series with coefficients in a finite field is algebraic if and only if the sequence of its coefficients can be generated by an automaton. We revisit and enhance two constructive proofs of this result for finite prime fields. The first proof uses Mahler equations, whose sizes appear to be prohibitively large. The second proof relies on diagonals of rational functions; we turn it into an efficient algorithm, of complexity linear in log N and quasi-linear in p.
- J.-P. Allouche and J. Shallit. The ring of k-regular sequences. Theoret. Comput. Sci., 98(2):163--197, 1992. Google Scholar
Digital Library
- J.-P. Allouche and J. Shallit. Automatic sequences. Cambridge University Press, 2003. Theory, applications, generalizations. Google ScholarDigital Library
- A. Bostan, F. Chyzak, G. Lecerf, B. Salvy, and É. Schost. Differential equations for algebraic functions. In ISSAC'07, pages 25--32. ACM Press, 2007. Google ScholarDigital Library
- A. Bostan, P. Gaudry, and É. Schost. Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operator. SIAM Journal on Computing, 36(6):1777--1806, 2007. Google ScholarDigital Library
- D. G. Cantor and E. Kaltofen. On fast multiplication of polynomials over arbitrary algebras. Acta Inform., 28(7):693--701, 1991. Google ScholarDigital Library
- G. Christol. Éléments algébriques. In Groupe de travail d'Analyse Ultra-métrique (1ère année : 1973/74), number 14, 10 pp. Secrétariat Mathématique, Paris, 1974.Google Scholar
- G. Christol. Ensembles presque periodiques k-reconnaissables. Theoret. Comput. Sci., 9(1):141--145, 1979.Google ScholarCross Ref
- G. Christol, T. Kamae, M. Mendès France, and G. Rauzy. Suites algébriques, automates et substitutions. Bull. Soc. Math. France, 108(4):401--419, 1980.Google ScholarCross Ref
- D. V. Chudnovsky and G. V. Chudnovsky. On expansion of algebraic functions in power and Puiseux series. I. J. Complexity, 2(4):271--294, 1986. Google ScholarDigital Library
- D. V. Chudnovsky and G. V. Chudnovsky. Approximations and complex multiplication according to Ramanujan. In Ramanujan revisited (Urbana-Champaign, 1987), pages 375--472. 1988.Google Scholar
- D. V. Chudnovsky and G. V. Chudnovsky. Computer algebra in the service of mathematical physics and number theory. In Computers in mathematics (Stanford, 1986), volume 125 of Lecture Notes in Pure and Appl. Math., pages 109--232. 1990.Google Scholar
- L. Comtet. Calcul pratique des coefficients de Taylor d'une fonction algébrique. Enseignemen Math., 10:267--270, 1964.Google Scholar
- P. Dumas. Récurrences mahlériennes, suites automatiques, études asymptotiques. PhD thesis, Univ. Bordeaux I, 1993. Available at https://tel.archives-ouvertes.fr/tel-00614660.Google Scholar
- C. M. Fiduccia. An efficient formula for linear recurrences. SIAM J. Comput., 14(1):106--112, 1985. Google ScholarDigital Library
- H. Furstenberg. Algebraic functions over finite fields. J. Algebra, 7:271--277, 1967.Google ScholarCross Ref
- F. L. Gall. Powers of tensors and fast matrix multiplication. In ISSAC'14, pages 296--303, 2014. Google ScholarDigital Library
- J.gathenvon zur Gathen and J. Gerhard. Modern computer algebra. Cambridge University Press, third edition, 2013. Google ScholarDigital Library
- D. Harvey, J. van der Hoeven, and G. Lecerf. Faster polynomial multiplication over finite fields. http://arxiv.org/abs/1407.3361, 2014.Google Scholar
- H. T. Kung and J. F. Traub. All algebraic functions can be computed fast. J. Assoc. Comput. Mach., 25(2):245--260, 1978. Google ScholarDigital Library
- J. C. P. Miller and D. J. Spencer Brown. An algorithm for evaluation of remote terms in a linear recurrence sequence. Computer Journal, 9:188--190, 1966.Google ScholarCross Ref
- K. Nishioka. Mahler Functions and Transcendence. Number 1631 in Lecture Notes in Mathematics. Springer, Berlin, 1996.Google Scholar
- E. Rowland and R. Yassawi. Automatic congruences for diagonals of rational functions. J. Théor. Nombres Bordeaux, 27(1):245--288, 2015.Google ScholarCross Ref
- A. Schönhage. Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2. Acta Informat., 7:395--398, 1977. Google ScholarDigital Library
- A. Storjohann. High-order lifting and integrality certification. J. Symb. Comp., 36(3--4):613--648, 2003. Google ScholarDigital Library
Index Terms
- Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field
Recommendations
Differential equations for algebraic functions
ISSAC '07: Proceedings of the 2007 international symposium on Symbolic and algebraic computationIt is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential equation of ...
Improving Complexity Bounds for the Computation of Puiseux Series over Finite Fields
ISSAC '15: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic ComputationLet K be a field of characteristic p with q elements and FΕ in L[X,Y] be a polynomial with p> deg_Y(F) and total degree d. In [40], we showed that rational Puiseux series of F above X=0 could be computed with an expected number of O~(d5+d3log q) ...
Algebraic Diagonals and Walks
ISSAC '15: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic ComputationThe diagonal of a multivariate power series $F$ is the univariate power series DiagF generated by the diagonal terms of F. Diagonals form an important class of power series; they occur frequently in number theory, theoretical physics and enumerative ...
Comments