<?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-01237861</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-04-28T16:00:20+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences</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>
              <ptr type="url" target="https://berthomieu.perso.lip6.fr"/>
              <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>
              <affiliation ref="#struct-179805"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Brice</forename>
                <surname>Boyer</surname>
              </persName>
              <email type="md5">66fa9697b26ae3a717391c95a619be90</email>
              <email type="domain">lip6.fr</email>
              <idno type="idhal" notation="numeric">973546</idno>
              <idno type="halauthorid" notation="string">375911-973546</idno>
              <affiliation ref="#struct-179805"/>
            </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>
              <affiliation ref="#struct-179805"/>
            </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>
            <funder ref="#projanr-15543"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-12-07 16:53:57</date>
              <date type="whenWritten">2015-01</date>
              <date type="whenModified">2025-02-26 15:24:03</date>
              <date type="whenReleased">2015-12-07 16:55:56</date>
              <date type="whenProduced">2015-07-06</date>
              <date type="whenEndEmbargoed">2015-12-07</date>
              <ref type="file" target="https://inria.hal.science/hal-01237861v1/document">
                <date notBefore="2015-12-07"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01237861v1/file/BMS-HAL.pdf" id="file-1238001-1317075">
                <date notBefore="2015-12-07"/>
              </ref>
              <ref type="externalLink" target="https://hal.inria.fr/hal-01237861/file/BMS-HAL.pdf"/>
            </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-01237861</idno>
            <idno type="halUri">https://inria.hal.science/hal-01237861</idno>
            <idno type="halBibtex">berthomieu:hal-01237861</idno>
            <idno type="halRefHtml">&lt;i&gt;40th International Symposium on Symbolic and Algebraic Computation&lt;/i&gt;, Jul 2015, Bath, United Kingdom. pp.61--68, &lt;a target="_blank" href="https://dx.doi.org/10.1145/2755996.2756673"&gt;&amp;#x27E8;10.1145/2755996.2756673&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">40th International Symposium on Symbolic and Algebraic Computation, Jul 2015, Bath, United Kingdom. pp.61--68, &amp;#x27E8;10.1145/2755996.2756673&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1238001-1317075"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <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-ROCQ">INRIA Paris - Rocquencourt</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="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</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="ALLIANCE-SU"> Alliance Sorbonne Université</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">Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences</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>
                  <ptr type="url" target="https://berthomieu.perso.lip6.fr"/>
                  <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>
                  <affiliation ref="#struct-179805"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Brice</forename>
                    <surname>Boyer</surname>
                  </persName>
                  <email type="md5">66fa9697b26ae3a717391c95a619be90</email>
                  <email type="domain">lip6.fr</email>
                  <idno type="idhal" notation="numeric">973546</idno>
                  <idno type="halauthorid" notation="string">375911-973546</idno>
                  <affiliation ref="#struct-179805"/>
                </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>
                  <affiliation ref="#struct-179805"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">ISSAC '15: Proceedings of the 2015 on International Symposium on Symbolic and Algebraic Computation</title>
                <meeting>
                  <title>40th International Symposium on Symbolic and Algebraic Computation</title>
                  <date type="start">2015-07-06</date>
                  <date type="end">2015-07-09</date>
                  <settlement>Bath</settlement>
                  <country key="GB">United Kingdom</country>
                </meeting>
                <imprint>
                  <biblScope unit="pp">61--68</biblScope>
                  <date type="datePub">2015-06-24</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1145/2755996.2756673</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">multidimensional linear recursive sequence</term>
                <term xml:lang="en">$0$-dimensional ideal</term>
                <term xml:lang="en">Gröbner basis computation</term>
                <term xml:lang="en">BMS and FGLM algorithms</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-sc">Computer Science [cs]/Symbolic Computation [cs.SC]</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>Sakata generalized the  Berlekamp -- Massey  algorithm to $n$ dimensions in~1988. The Berlekamp -- Massey -- Sakata (BMS)algorithm can be used for finding a Gröbner basis of a $0$-dimensionalideal of relations verified by a table. We investigate this problem usinglinear algebra techniques, with motivations such as accelerating change ofbasis algorithms (FGLM) or improving their complexity.We first define and characterize multidimensional linear recursive sequencesfor $0$-dimensional ideals.Under genericity assumptions, we propose a randomized preprocessing of thetable that corresponds to performing a linear change of coordinates on thepolynomials associated with the linear recurrences. This technique thenessentially reduces our problem to using the efficient $1$-dimensional Berlekamp -- Massey (BM)algorithm.However, the number of probes to the table in this scheme may be elevated.We thus consider the table in the \emph{black-box} model: we assume probing thetable is expensive and we minimize the number of probes to the table in ourcomplexity model.We produce an FGLM-like algorithm for finding the relations in thetable, which lets us use linear algebra techniques.  Under some additionalassumptions, we make this algorithm adaptive and reduce further the numberof table probes.This number can be estimated by counting the number of distinct elements in amulti-Hankel matrix (a multivariate generalization of Hankel matrices); we canrelate this quantity with the \emph{geometry} of the final staircase.  Hence,in favorable cases such as convex ones, the complexity is essentially linear inthe size of the output. Finally, when using the \textsc{lex} ordering, we canmake use of fast structured linear algebra similarly to the Hankelinterpretation of Berlekamp -- Massey.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-179805" status="OLD">
          <idno type="RNSR">201221011R</idno>
          <orgName>Polynomial Systems</orgName>
          <orgName type="acronym">PolSys</orgName>
          <date type="start">2012-01-01</date>
          <date type="end">2015-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/polsys</ref>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
            <relation active="#struct-86790" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</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-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.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="laboratory" xml:id="struct-86790" status="OLD">
          <orgName>Inria Paris-Rocquencourt</orgName>
          <date type="end">2016-03-30</date>
          <desc>
            <address>
              <addrLine>INRIA Rocquencourt : Domaine de Voluceau, Rocquencourt B.P. 105 78153 le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/paris-rocquencourt</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>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-15543" status="VALID">
          <idno type="anr">ANR-11-BS02-0013</idno>
          <orgName>HPAC</orgName>
          <desc>Calcul Algébrique Haute-Performance</desc>
          <date type="start">2011</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>