<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0 plus SVG 1.1//EN" "http://www.w3.org/2002/04/xhtml-math-svg/xhtml-math-svg.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
  <head>
    <meta http-equiv="Content-Type" content="application/xhtml+xml; charset=utf-8"/>
    <title>Project-Team:SPECFUN</title>
    <link rel="stylesheet" href="../static/css/raweb.css" type="text/css"/>
    <meta name="description" content="New Results - Criterion for the existence of telescopers for mixed hypergeometric terms"/>
    <meta name="dc.title" content="New Results - Criterion for the existence of telescopers for mixed hypergeometric terms"/>
    <meta name="dc.subject" content=""/>
    <meta name="dc.publisher" content="INRIA"/>
    <meta name="dc.date" content="(SCHEME=ISO8601) 2014-01"/>
    <meta name="dc.type" content="Report"/>
    <meta name="dc.language" content="(SCHEME=ISO639-1) en"/>
    <meta name="projet" content="SPECFUN"/>
    <!-- Piwik -->
    <script type="text/javascript" src="/rapportsactivite/piwik.js"></script>
    <noscript><p><img src="//piwik.inria.fr/piwik.php?idsite=49" style="border:0;" alt="" /></p></noscript>
    <!-- End Piwik Code -->
  </head>
  <body>
    <div class="tdmdiv">
      <div class="logo">
        <a href="http://www.inria.fr">
          <img style="align:bottom; border:none" src="../static/img/icons/logo_INRIA-coul.jpg" alt="Inria"/>
        </a>
      </div>
      <div class="TdmEntry">
        <div class="tdmentete">
          <a href="uid0.html">Project-Team Specfun</a>
        </div>
        <span>
          <a href="uid1.html">Members</a>
        </span>
      </div>
      <div class="TdmEntry">Overall Objectives<ul><li><a href="./uid3.html">Scientific challenges, expected impact</a></li><li><a href="./uid16.html">Research axes</a></li></ul></div>
      <div class="TdmEntry">Research Program<ul><li><a href="uid29.html&#10;&#9;&#9;  ">Studying special functions by computer algebra</a></li><li><a href="uid45.html&#10;&#9;&#9;  ">Trusted computer-algebra calculations</a></li><li><a href="uid56.html&#10;&#9;&#9;  ">Machine-checked proofs of formalized mathematics</a></li></ul></div>
      <div class="TdmEntry">Application Domains<ul><li><a href="uid63.html&#10;&#9;&#9;  ">Experimental mathematics with special functions</a></li></ul></div>
      <div class="TdmEntry">New Software and Platforms<ul><li><a href="uid65.html&#10;&#9;&#9;  ">SSReflect</a></li><li><a href="uid67.html&#10;&#9;&#9;  ">The Mathematical Components library</a></li><li><a href="uid69.html&#10;&#9;&#9;  ">Coq</a></li><li><a href="uid70.html&#10;&#9;&#9;  ">Coq/jEdit</a></li><li><a href="uid71.html&#10;&#9;&#9;  ">Other maintained software</a></li></ul></div>
      <div class="TdmEntry">New Results<ul><li><a href="uid77.html&#10;&#9;&#9;  ">Highlights of the Year</a></li><li><a href="uid78.html&#10;&#9;&#9;  ">A formal proof of the irrationality
of <m:math xmlns:m="http://www.w3.org/1998/Math/MathML" overflow="scroll"><mrow xmlns="http://www.w3.org/1998/Math/MathML"><mi>ζ</mi><mo>(</mo><mn>3</mn><mo>)</mo></mrow></m:math></a></li><li class="tdmActPage"><a href="uid82.html&#10;&#9;&#9;  ">Criterion for the existence of telescopers for mixed hypergeometric terms</a></li><li><a href="uid83.html&#10;&#9;&#9;  ">Integration of rational functions</a></li><li><a href="uid87.html&#10;&#9;&#9;  ">Efficient algorithms for linear
differential equations in positive characteristic</a></li><li><a href="uid88.html&#10;&#9;&#9;  ">Efficient algorithms for
rational first integrals</a></li><li><a href="uid89.html&#10;&#9;&#9;  ">Computation of necessary integrability conditions for parametrized Hamiltonian systems</a></li><li><a href="uid90.html&#10;&#9;&#9;  ">Non-D-finite excursions in the quarter plane</a></li><li><a href="uid91.html&#10;&#9;&#9;  ">A human proof of the Gessel conjecture</a></li><li><a href="uid92.html&#10;&#9;&#9;  ">Enumeration of 3-dimensional lattice walks confined to the positive octant</a></li><li><a href="uid93.html&#10;&#9;&#9;  ">Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: Algebraic and analytic approaches collated</a></li><li><a href="uid94.html&#10;&#9;&#9;  ">Asynchronous interaction with Coq</a></li></ul></div>
      <div class="TdmEntry">Bilateral Contracts and Grants with Industry<ul><li><a href="uid96.html&#10;&#9;&#9;  ">Bilateral Contracts with Industry</a></li></ul></div>
      <div class="TdmEntry">Partnerships and Cooperations<ul><li><a href="uid99.html&#10;&#9;&#9;  ">Regional Initiatives</a></li><li><a href="uid101.html&#10;&#9;&#9;  ">National Initiatives</a></li><li><a href="uid105.html&#10;&#9;&#9;  ">International Research Visitors</a></li></ul></div>
      <div class="TdmEntry">Dissemination<ul><li><a href="uid108.html&#10;&#9;&#9;  ">Promoting Scientific Activities</a></li><li><a href="uid127.html&#10;&#9;&#9;  ">Teaching - Supervision - Juries</a></li><li><a href="uid144.html&#10;&#9;&#9;  ">Keynote talks</a></li><li><a href="uid147.html&#10;&#9;&#9;  ">Popularization</a></li></ul></div>
      <div class="TdmEntry">
        <div>Bibliography</div>
      </div>
      <div class="TdmEntry">
        <ul>
          <li>
            <a id="tdmbibentyear" href="bibliography.html">Publications of the year</a>
          </li>
          <li>
            <a id="tdmbibentfoot" href="bibliography.html#References">References in notes</a>
          </li>
        </ul>
      </div>
    </div>
    <div id="main">
      <div class="mainentete">
        <div id="head_agauche">
          <small><a href="http://www.inria.fr">
	    
	    Inria
	  </a> | <a href="../index.html">
	    
	    Raweb 
	    2014</a> | <a href="http://www.inria.fr/en/teams/specfun">Presentation of the Project-Team SPECFUN</a></small>
        </div>
        <div id="head_adroite">
          <table class="qrcode">
            <tr>
              <td>
                <a href="specfun.xml">
                  <img style="align:bottom; border:none" alt="XML" src="../static/img/icons/xml_motif.png"/>
                </a>
              </td>
              <td>
                <a href="specfun.pdf">
                  <img style="align:bottom; border:none" alt="PDF" src="IMG/qrcode-specfun-pdf.png"/>
                </a>
              </td>
              <td>
                <a href="../specfun/specfun.epub">
                  <img style="align:bottom; border:none" alt="e-pub" src="IMG/qrcode-specfun-epub.png"/>
                </a>
              </td>
            </tr>
            <tr>
              <td/>
              <td>PDF
</td>
              <td>e-Pub
</td>
            </tr>
          </table>
        </div>
      </div>
      <!--FIN du corps du module-->
      <br/>
      <div class="bottomNavigation">
        <div class="tail_aucentre">
          <a href="./uid78.html" accesskey="P"><img style="align:bottom; border:none" alt="previous" src="../static/img/icons/previous_motif.jpg"/> Previous | </a>
          <a href="./uid0.html" accesskey="U"><img style="align:bottom; border:none" alt="up" src="../static/img/icons/up_motif.jpg"/>  Home</a>
          <a href="./uid83.html" accesskey="N"> | Next <img style="align:bottom; border:none" alt="next" src="../static/img/icons/next_motif.jpg"/></a>
        </div>
        <br/>
      </div>
      <div id="textepage">
        <!--DEBUT2 du corps du module-->
        <h2>Section: 
      New Results</h2>
        <h3 class="titre3">Criterion for the existence of telescopers for mixed hypergeometric terms</h3>
        <p>Creative telescoping is a process that determines a univariate recurrence
satisfied by the sum of a summand described by a system of bivariate
recurrences. For hypergeometric summands, that is, summands given by
first-order linear recurrences, this has led to Zeilberger's algorithm in the
early 1990s, since then followed by a large number of works, including a natural
counterpart for integration. The history of creative-telescoping algorithms was
surveyed this year in Chyzak's HDR <a href="./bibliography.html#specfun-2014-bid55">[1]</a> . Also this year,
we presented in <a href="./bibliography.html#specfun-2014-bid56">[6]</a>  a criterion for the existence of
telescopers for mixed hypergeometric terms, which is based on additive and
multiplicative decompositions. The criterion had enabled us to determine the
termination of Zeilberger's algorithms for mixed hypergeometric inputs prior to
any costly computations, and to verify that certain indefinite sums do not
satisfy any polynomial differential equation.</p>
      </div>
      <!--FIN du corps du module-->
      <br/>
      <div class="bottomNavigation">
        <div class="tail_aucentre">
          <a href="./uid78.html" accesskey="P"><img style="align:bottom; border:none" alt="previous" src="../static/img/icons/previous_motif.jpg"/> Previous | </a>
          <a href="./uid0.html" accesskey="U"><img style="align:bottom; border:none" alt="up" src="../static/img/icons/up_motif.jpg"/>  Home</a>
          <a href="./uid83.html" accesskey="N"> | Next <img style="align:bottom; border:none" alt="next" src="../static/img/icons/next_motif.jpg"/></a>
        </div>
        <br/>
      </div>
    </div>
  </body>
</html>
