skip to main content
10.1145/281508.281646acmconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
Article
Free Access

High degree solutions of low degree equations (extended abstract)

Authors Info & Claims
Published:01 August 1998Publication History
First page image

References

  1. 1.ABRAMOV, S. A. On the summation of rational functions. 2. Vygisl. Mat. i Mat. Fiz. 11 (1971)F 1071-1075. English translation in U.S.S.R. Computational Mathematics and Mathematical Physics.Google ScholarGoogle Scholar
  2. 2.ABRAMOV, S. A. Problems in computer algebra involved in the search for polynomial solutions of linear differential and difference equations. Moscow Univ. Comput. Math. and Cybernet. 3 (1989)F 63-68.Google ScholarGoogle Scholar
  3. 3.ABRAMOV, S. A. Rational solutions of linear differential and difference equations with polynomial coefficients. U.S.S.R. Comput. Maths. Math. Phys. 29 (1989)F 7-12. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.ABRAMOV, S. A. Rational solutions of linear difference and q-difference equations with polynomial coefficients. In Proc. 1995 Internat. Symp. Symb. Alg. Cornput. (1995)F X?M PressF pp. 285-289. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.ABRAMOV, S. A., BRONSTEIN, M., AND PETKOVgEK, M. On polynomial solutions of linear operator equations. In Proc. 1995 Internat. Syrup. Symb. Alg. Cornput. (1995)F X?M PressF pp. 290-296. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.BRONSTEIN, M. The transcendental Risch differential equation. J. Symbolic Comput. 9 (1990)F 49-60. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.BRONSTEIN, M. The algebraic Risch differential equation. In Proc. 1991 Internat. Symp. Symb. Alg. Cornput. (1991)F X?M PressF pp. 241-246. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.BRONSTEIN, M. Symbolic Integration I- Transcendental Functions. No. 1 in Algorithms and Computation in Mathematics. Springer-VerlagF HeidelbergF 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.DAVENPORT, J. H. The Risch differential equation problem. SIAM J. Comput. 15 (1986)F 903-918. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.EKHAD, S. B. A very short proof of Dixon's theorem. J. Combin. Theory. Set. A 5~ (1990)F 141-142. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.EKHAD, S. B., AND TRE, S. A purely verification proof of the first Rogers-Ramanujan identity. J. Combin. Theory. Set. A 5~ (1990)F 309-311. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. 12.VON ZUR GATHEN, J., AND GERHARD, J. Fast algorithms for Taylor shifts and certain difference equations. In Proc. 1997 Internat. Symp. Symb. Alg. Cornput. (MauiF 1997)F I~M PressF pp. 40-47. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.GOSPER, JR., R. W. Decision procedure for indefinite hypergeometric summation. Proc. Nat. Acad. Sci. U. S. A. 25 (1978)F 40-42.Google ScholarGoogle ScholarCross RefCross Ref
  14. 14.HERMITE, C. Sur l'int~gration des fractions rationelles. Nouvelles Annales de Mathdmatiques (2~'~ sdrie) 11 (1872)F 145-148.Google ScholarGoogle Scholar
  15. 15.KARR, M. Summation in finite terms. J. Assoc. Comput. Mach. 28 (1981)F 305-350. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16.KARR, M. Theory of summation in finite terms. J. Symbolic Comput. 1 (1985)F 303-315. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17.LISONI~K, P., PAULE, P., AND STREHL, V. Improvement of the degree setting in Gosper's algorithm. J. Symbolic Comput. 16 (1993)F 243-258. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18.MOENCK, R. On computing closed forms for summation. In Proceedings of the 1977 MA CSYMA Users Conference (BerkeleyF 1977)F pp. 225-236.Google ScholarGoogle Scholar
  19. 19.PAULE, P. Greatest factorial factorization and symbolic summation. J. Symbolic Comput. 20 (1995)F 235-268. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20.PAULE, P., AND STREHL, V. Symbolic summation some recent developments. In Computer Algebra in Science and Engineering (BielefeldFGermanyF August 1994)F V6rld ScientificF pp. 138-162.Google ScholarGoogle Scholar
  21. 21.PETKOVSEK, M. Hypergeometric solutions of linear recurrences with polynomial coefficients. J. Symbolic Comput. 1~ (1992)F 243-264. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22.PIRASTU, R., AND STREHL, V. Rational summation and Gosper-Petkovgek representation. J. Symbolic Comput. 20 (1995)F 617-635. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 23.RISCH, R. H. The problem of integration in finite terms. Trans. Amer. Math. Soc. 139 (1969)F 167-189.Google ScholarGoogle ScholarCross RefCross Ref
  24. 24.ROTHSTEIN~ M. Aspects of symbolic integration and simplification of exponential and primitive functions. PhD thesisF Uniersity of Wisconsin-MadisonF 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. 25.TRAGER, B. M. Algebraic factoring and rational function integration. In Proc. A CM Syrup. Symbolic and Algebraic Computation (ed. R. D. JENzSFYorktown HeightsF NYF 1976)F pp. 219-226. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. 26.WILF, H. S., AND ZEILBERGER, D. Rational functions certify combinatorial identities. J. Amer. Math. Soc. 3 (1990)r 147-158.Google ScholarGoogle ScholarCross RefCross Ref
  27. 27.WILF, H. S., AND ZEILBERGER, D. An algorithmic proof theory for hypergeometric (ordinary and "q") multisum/integral identities. Inventiones Math. 108 (1992)r 575-633.Google ScholarGoogle ScholarCross RefCross Ref
  28. 28.ZEILBERGER, D. A fast algorithm for proving terminating hypergeometric identities. Discrete Math. 80 (1990)r 207-211. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. 29.ZEILBERGER, D. A holonomic systems approach to special function identities. J. Comput. Appl. Math. 32 (1990)F 321-368. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. 30.ZEILBERGER, D. The method of creative telescoping. J. Symbolic Comput. 11 (1991)F 195-204. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. High degree solutions of low degree equations (extended abstract)

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        ISSAC '98: Proceedings of the 1998 international symposium on Symbolic and algebraic computation
        August 1998
        330 pages
        ISBN:1581130023
        DOI:10.1145/281508

        Copyright © 1998 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 August 1998

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate395of838submissions,47%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader