<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-03616406v2</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-19T11:34:36+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Algorithms for discrete differential equations of order 1</title>
            <author role="aut">
              <persName>
                <forename type="first">Alin</forename>
                <surname>Bostan</surname>
              </persName>
              <email type="md5">09c400f106572c39c4362f555fd5c489</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="numeric">831654</idno>
              <idno type="halauthorid" notation="string">124926-831654</idno>
              <orgName ref="#struct-300009"/>
              <affiliation ref="#struct-1096341"/>
              <affiliation ref="#struct-211984"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Frédéric</forename>
                <surname>Chyzak</surname>
              </persName>
              <email type="md5">976d6521ffad05d7bd87002801f135ee</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">frederic-chyzak</idno>
              <idno type="idhal" notation="numeric">1159</idno>
              <idno type="halauthorid" notation="string">30393-1159</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-3114-1191</idno>
              <idno type="IDREF">https://www.idref.fr/15406257X</idno>
              <affiliation ref="#struct-1096341"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Hadrien</forename>
                <surname>Notarantonio</surname>
              </persName>
              <email type="md5">ae77822a228d453cc0cc896138953e63</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="numeric">1130794</idno>
              <idno type="halauthorid" notation="string">2458977-1130794</idno>
              <affiliation ref="#struct-1096341"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Mohab</forename>
                <surname>Safey El Din</surname>
              </persName>
              <email type="md5">0f084a5d7df61511bbd70db6ea16179c</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="string">safey</idno>
              <idno type="idhal" notation="numeric">731</idno>
              <idno type="halauthorid" notation="string">2144-731</idno>
              <idno type="IDREF">https://www.idref.fr/180664549</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/CPK-3689-2022</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-9463-1257</idno>
              <idno type="VIAF">https://viaf.org/viaf/313567630</idno>
              <affiliation ref="#struct-1060652"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hadrien</forename>
                <surname>Notarantonio</surname>
              </persName>
              <email type="md5">ae77822a228d453cc0cc896138953e63</email>
              <email type="domain">inria.fr</email>
            </editor>
            <funder ref="#projanr-50512"/>
            <funder ref="#projanr-50572"/>
            <funder ref="#projeurop-712790"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2022-03-22 19:09:53</date>
            </edition>
            <edition n="v2" type="current">
              <date type="whenSubmitted">2022-05-20 16:33:56</date>
              <date type="whenModified">2025-02-26 15:22:03</date>
              <date type="whenReleased">2022-05-20 17:30:36</date>
              <date type="whenProduced">2022-07-04</date>
              <date type="whenEndEmbargoed">2022-05-20</date>
              <ref type="file" target="https://inria.hal.science/hal-03616406v2/document">
                <date notBefore="2022-05-20"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-03616406v2/file/BoChNoSa22-hal-v2.pdf" id="file-3674573-3208243">
                <date notBefore="2022-05-20"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="1159547">
                <persName>
                  <forename>Hadrien</forename>
                  <surname>Notarantonio</surname>
                </persName>
                <email type="md5">ae77822a228d453cc0cc896138953e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03616406</idno>
            <idno type="halUri">https://inria.hal.science/hal-03616406</idno>
            <idno type="halBibtex">bostan:hal-03616406</idno>
            <idno type="halRefHtml">&lt;i&gt;ISSAC 2022 - 47th International Symposium on Symbolic and Algebraic Computation&lt;/i&gt;, Jul 2022, Lille, France. pp.101-110</idno>
            <idno type="halRef">ISSAC 2022 - 47th International Symposium on Symbolic and Algebraic Computation, Jul 2022, Lille, France. pp.101-110</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-3674573-3208243"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-SACLAY" corresp="INRIA">INRIA Saclay - Ile de France</idno>
            <idno type="stamp" n="OPENAIRE">OpenAIRE</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="INRIA-300009">Inria 300009</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SORBONNE-UNIV" corresp="SORBONNE-UNIVERSITE">Sorbonne Université 01/01/2018</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="SUPRA_MATHS_INFO">Mathématiques + Informatique</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Algorithms for discrete differential equations of order 1</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Alin</forename>
                    <surname>Bostan</surname>
                  </persName>
                  <email type="md5">09c400f106572c39c4362f555fd5c489</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="numeric">831654</idno>
                  <idno type="halauthorid" notation="string">124926-831654</idno>
                  <orgName ref="#struct-300009"/>
                  <affiliation ref="#struct-1096341"/>
                  <affiliation ref="#struct-211984"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Frédéric</forename>
                    <surname>Chyzak</surname>
                  </persName>
                  <email type="md5">976d6521ffad05d7bd87002801f135ee</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">frederic-chyzak</idno>
                  <idno type="idhal" notation="numeric">1159</idno>
                  <idno type="halauthorid" notation="string">30393-1159</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-3114-1191</idno>
                  <idno type="IDREF">https://www.idref.fr/15406257X</idno>
                  <affiliation ref="#struct-1096341"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Hadrien</forename>
                    <surname>Notarantonio</surname>
                  </persName>
                  <email type="md5">ae77822a228d453cc0cc896138953e63</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="numeric">1130794</idno>
                  <idno type="halauthorid" notation="string">2458977-1130794</idno>
                  <affiliation ref="#struct-1096341"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Mohab</forename>
                    <surname>Safey El Din</surname>
                  </persName>
                  <email type="md5">0f084a5d7df61511bbd70db6ea16179c</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="string">safey</idno>
                  <idno type="idhal" notation="numeric">731</idno>
                  <idno type="halauthorid" notation="string">2144-731</idno>
                  <idno type="IDREF">https://www.idref.fr/180664549</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/CPK-3689-2022</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-9463-1257</idno>
                  <idno type="VIAF">https://viaf.org/viaf/313567630</idno>
                  <affiliation ref="#struct-1060652"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>ISSAC 2022 - 47th International Symposium on Symbolic and Algebraic Computation</title>
                  <date type="start">2022-07-04</date>
                  <date type="end">2022-07-07</date>
                  <settlement>Lille</settlement>
                  <country key="FR">France</country>
                </meeting>
                <imprint>
                  <biblScope unit="pp">101–110</biblScope>
                  <date type="datePub">2022</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Catalytic variables</term>
                <term xml:lang="en">Functional equations</term>
                <term xml:lang="en">Discrete differential equations</term>
                <term xml:lang="en">Algebraic functions</term>
                <term xml:lang="en">Algorithms</term>
                <term xml:lang="en">Complexity</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-sc">Computer Science [cs]/Symbolic Computation [cs.SC]</classCode>
              <classCode scheme="halDomain" n="info.info-cg">Computer Science [cs]/Computational Geometry [cs.CG]</classCode>
              <classCode scheme="halDomain" n="math.math-co">Mathematics [math]/Combinatorics [math.CO]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Discrete differential equations of order 1 are equations relating polynomially $F(t,u)$, a power series in $t$ with polynomial coefficients in a ``catalytic'' variable~$u$, and one of its specializations, say~$F(t,1)$. Such equations are ubiquitous in combinatorics, notably in the enumeration of maps and walks. When the solution $F$ is unique, a celebrated result by Bousquet-M\'elou, reminiscent of Popescu's theorem in commutative algebra, states that $F$ is \emph{algebraic}. We address algorithmic and complexity questions related to this result. In \emph{generic} situations, we first revisit and analyze known algorithms, based either on polynomial elimination or on the guess-and-prove paradigm. We then design two new algorithms: the first has a geometric flavor, the second blends elimination and guess-and-prove. In the \emph{general} case (no genericity assumptions), we prove that the total arithmetic size of the algebraic equations for $F(t,1)$ is bounded polynomially in the size of the input discrete differential equation, and that one can compute such equations in polynomial time.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-1096341" status="VALID">
          <idno type="RNSR">202224256Z</idno>
          <idno type="ROR">https://ror.org/02fh7gz32</idno>
          <orgName>Calcul formel, mathématiques expérimentales et interactions</orgName>
          <orgName type="acronym">MATHEXP</orgName>
          <date type="start">2022-04-01</date>
          <date type="end">2026-03-31</date>
          <desc>
            <address>
              <addrLine>1 Rue Honoré d'Estienne d'Orves, 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.inria.fr/fr/mathexp</ref>
          </desc>
          <listRelation>
            <relation active="#struct-118511" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-211984" status="OLD">
          <idno type="RNSR">201221067B</idno>
          <orgName>Symbolic Special Functions : Fast and Certified</orgName>
          <orgName type="acronym">SPECFUN</orgName>
          <date type="start">2012-11-01</date>
          <date type="end">2022-03-31</date>
          <desc>
            <address>
              <addrLine>Inria, Bâtiment Alan Turing 1 rue Honoré d'Estienne d'Orves Campus de l'École Polytechnique 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/specfun</ref>
          </desc>
          <listRelation>
            <relation active="#struct-118511" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-1060652" status="VALID">
          <orgName>Polynomial Systems</orgName>
          <orgName type="acronym">PolSys</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lip6.fr/recherche/team.php?acronyme=PolSys</ref>
          </desc>
          <listRelation>
            <relation active="#struct-541703" type="direct"/>
            <relation active="#struct-413221" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-118511" status="VALID">
          <idno type="RNSR">200818248E</idno>
          <idno type="ROR">https://ror.org/0315e5x55</idno>
          <orgName>Centre Inria de Saclay</orgName>
          <desc>
            <address>
              <addrLine>1 rue Honoré d'Estienne d'OrvesBâtiment Alan TuringCampus de l'École Polytechnique91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/saclay</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-541703" status="VALID">
          <idno type="IdRef">13558292X</idno>
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>LIP6</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-413221" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-413221" status="VALID">
          <idno type="IdRef">221333754</idno>
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Sorbonne Université</orgName>
          <orgName type="acronym">SU</orgName>
          <date type="start">2018-01-01</date>
          <desc>
            <address>
              <addrLine>21 rue de l’École de médecine - 75006 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.sorbonne-universite.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-50512" status="VALID">
          <idno type="anr">ANR-19-CE40-0018</idno>
          <orgName>DeRerumNatura</orgName>
          <desc>Décider l'irrationalité et la transcendance</desc>
          <date type="start">2019</date>
        </org>
        <org type="anrProject" xml:id="projanr-50572" status="VALID">
          <idno type="anr">ANR-19-CE48-0015</idno>
          <orgName>ECARP</orgName>
          <desc>Algorithmes efficaces et exacts pour la planification de trajectoire en robotique</desc>
          <date type="start">2019</date>
        </org>
        <org type="europeanProject" xml:id="projeurop-712790" status="VALID">
          <idno type="number">813211</idno>
          <idno type="program">H2020-MSCA-ITN-2018</idno>
          <idno type="call">H2020-MSCA-ITN-2018</idno>
          <orgName>POEMA</orgName>
          <desc>Polynomial Optimization, Efficiency through Moments and Algebra</desc>
          <date type="start">2019-01-01</date>
          <date type="end">2023-06-30</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>