<?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-01935229v2</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-24T02:22:47+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations</title>
            <author role="aut">
              <persName>
                <forename type="first">Jérémy</forename>
                <surname>Berthomieu</surname>
              </persName>
              <email type="md5">09bd81d4ebd85c4d234adfe6aec507b4</email>
              <email type="domain">lix.polytechnique.fr</email>
              <idno type="idhal" notation="string">jeremy-berthomieu</idno>
              <idno type="idhal" notation="numeric">3844</idno>
              <idno type="halauthorid" notation="string">18640-3844</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9011-2211</idno>
              <idno type="IDREF">https://www.idref.fr/163559457</idno>
              <orgName ref="#struct-93591"/>
              <affiliation ref="#struct-1060652"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jean-Charles</forename>
                <surname>Faugère</surname>
              </persName>
              <email type="md5">424972c8b3e59f15dec87335bdbaf554</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">faugere</idno>
              <idno type="idhal" notation="numeric">19366</idno>
              <idno type="halauthorid" notation="string">2141-19366</idno>
              <idno type="IDREF">https://www.idref.fr/090173449</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/COI-0285-2022</idno>
              <orgName ref="#struct-441569"/>
              <affiliation ref="#struct-575365"/>
              <affiliation ref="#struct-1060652"/>
              <affiliation ref="#struct-454310"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Jérémy</forename>
                <surname>Berthomieu</surname>
              </persName>
              <email type="md5">ae9490a9b9ff687e2c554fa60f2022fc</email>
              <email type="domain">lip6.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2018-11-26 15:21:31</date>
            </edition>
            <edition n="v2" type="current">
              <date type="whenSubmitted">2020-08-27 11:06:58</date>
              <date type="whenModified">2025-07-22 08:34:02</date>
              <date type="whenReleased">2020-08-27 17:46:51</date>
              <date type="whenProduced">2020-08-27</date>
              <date type="whenEndEmbargoed">2020-08-27</date>
              <ref type="file" target="https://inria.hal.science/hal-01935229v2/document">
                <date notBefore="2020-08-27"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01935229v2/file/main.pdf" id="file-2923526-2574344">
                <date notBefore="2020-08-27"/>
              </ref>
            </edition>
            <edition n="v3">
              <date type="whenSubmitted">2021-07-06 14:46:17</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="151812">
                <persName>
                  <forename>Jérémy</forename>
                  <surname>Berthomieu</surname>
                </persName>
                <email type="md5">ae9490a9b9ff687e2c554fa60f2022fc</email>
                <email type="domain">lip6.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01935229</idno>
            <idno type="halUri">https://inria.hal.science/hal-01935229</idno>
            <idno type="halBibtex">berthomieu:hal-01935229</idno>
            <idno type="halRefHtml">2020</idno>
            <idno type="halRef">2020</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-2923526-2574344"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt/>
          <notesStmt/>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Jérémy</forename>
                    <surname>Berthomieu</surname>
                  </persName>
                  <email type="md5">09bd81d4ebd85c4d234adfe6aec507b4</email>
                  <email type="domain">lix.polytechnique.fr</email>
                  <idno type="idhal" notation="string">jeremy-berthomieu</idno>
                  <idno type="idhal" notation="numeric">3844</idno>
                  <idno type="halauthorid" notation="string">18640-3844</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9011-2211</idno>
                  <idno type="IDREF">https://www.idref.fr/163559457</idno>
                  <orgName ref="#struct-93591"/>
                  <affiliation ref="#struct-1060652"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean-Charles</forename>
                    <surname>Faugère</surname>
                  </persName>
                  <email type="md5">424972c8b3e59f15dec87335bdbaf554</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">faugere</idno>
                  <idno type="idhal" notation="numeric">19366</idno>
                  <idno type="halauthorid" notation="string">2141-19366</idno>
                  <idno type="IDREF">https://www.idref.fr/090173449</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/COI-0285-2022</idno>
                  <orgName ref="#struct-441569"/>
                  <affiliation ref="#struct-575365"/>
                  <affiliation ref="#struct-1060652"/>
                  <affiliation ref="#struct-454310"/>
                </author>
              </analytic>
              <monogr>
                <imprint/>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Berlekamp-Massey-Sakata</term>
                <term xml:lang="en">Linear recursive sequences</term>
                <term xml:lang="en">Gröbner bases</term>
                <term xml:lang="en">Extended Euclidean algorithm</term>
                <term xml:lang="en">Padé approximants</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-sc">Computer Science [cs]/Symbolic Computation [cs.SC]</classCode>
              <classCode scheme="halTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
              <classCode scheme="halOldTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
              <classCode scheme="halTreeTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Sparse polynomial interpolation, sparse linear system solving or modular rational reconstruction are fundamental problems in Computer Algebra. They come down to computing linear recurrence relations of a sequence with the Berlekamp-Massey algorithm. Likewise, sparse multivariate polynomial interpolation and multidimensional cyclic code decoding require guessing linear recurrence relations of a multivariate sequence.Several algorithms solve this problem. The so-called Berlekamp-Massey-Sakata algorithm (1988) uses polynomial additions and shifts by a monomial. The Scalar-FGLM algorithm (2015) relies on linear algebra operations on a multi-Hankel matrix, a multivariate generalization of a Hankel matrix. The Artinian Gorenstein border basis algorithm (2017) uses a Gram-Schmidt process.We propose a new algorithm for computing the Gröbner basis of the ideal of relations of a sequence based solely on multivariate polynomial arithmetic. This algorithm allows us to both revisit the Berlekamp-Massey-Sakata algorithm through the use of polynomial divisions and to completely revise the Scalar-FGLM algorithm without linear algebra operations.A key observation in the design of this algorithm is to work on the mirror of the truncated generating series allowing us to use polynomial arithmetic modulo a monomial ideal. It appears to have some similarities with Padé approximants of this mirror polynomial.As an addition from the paper published at the ISSAC conferance, we give an adaptive variant of this algorithm taking into account the shape of the final Gröbner basis gradually as it is discovered. The main advantage of this algorithm is that its complexity in terms of operations and sequence queries only depends on the output Gröbner basis.All these algorithms have been implemented in Maple and we report on our comparisons.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <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="institution" xml:id="struct-575365" status="VALID">
          <orgName>CryptoNext Security</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://cryptonext-security.com/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-454310" status="VALID">
          <idno type="IdRef">241614864</idno>
          <idno type="RNSR">196718247G</idno>
          <idno type="ROR">https://ror.org/05eyd5d35</idno>
          <orgName>Centre Inria de Paris</orgName>
          <date type="start">2016-03-10</date>
          <desc>
            <address>
              <addrLine>48 Rue Barrault, 75013 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/paris</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </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>
        <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>
      </listOrg>
    </back>
  </text>
</TEI>