<?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 inria-00119287v2</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-18T03:35:24+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Explicit factors of some iterated resultants and discriminants</title>
            <author role="aut">
              <persName>
                <forename type="first">Laurent</forename>
                <surname>Busé</surname>
              </persName>
              <email type="md5">1d07661f1fc93eb2d468ccf689fe5810</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">laurent-buse</idno>
              <idno type="idhal" notation="numeric">180598</idno>
              <idno type="halauthorid" notation="string">2107-180598</idno>
              <idno type="IDREF">https://www.idref.fr/074519786</idno>
              <idno type="ORCID">https://orcid.org/0009-0005-6528-7027</idno>
              <orgName ref="#struct-300009"/>
              <affiliation ref="#struct-2461"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Bernard</forename>
                <surname>Mourrain</surname>
              </persName>
              <email type="md5">99d2b72427e88e39557fd123d18bb4ee</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">bernard-mourrain</idno>
              <idno type="idhal" notation="numeric">397</idno>
              <idno type="halauthorid" notation="string">15487-397</idno>
              <idno type="IDREF">https://www.idref.fr/050178725</idno>
              <affiliation ref="#struct-2461"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Laurent</forename>
                <surname>Busé</surname>
              </persName>
              <email type="md5">1d07661f1fc93eb2d468ccf689fe5810</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2006-12-08 14:50:21</date>
            </edition>
            <edition n="v2" type="current">
              <date type="whenSubmitted">2007-10-15 18:49:42</date>
              <date type="whenModified">2025-08-26 15:21:01</date>
              <date type="whenReleased">2007-10-15 19:02:30</date>
              <date type="whenProduced">2009</date>
              <date type="whenEndEmbargoed">2007-10-15</date>
              <ref type="file" target="https://inria.hal.science/inria-00119287v2/document">
                <date notBefore="2007-10-15"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/inria-00119287v2/file/HALIteRes.pdf" id="file-179534-579538">
                <date notBefore="2007-10-15"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/cs/0612050"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="111169">
                <persName>
                  <forename>Laurent</forename>
                  <surname>Busé</surname>
                </persName>
                <email type="md5">1d07661f1fc93eb2d468ccf689fe5810</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">inria-00119287</idno>
            <idno type="halUri">https://inria.hal.science/inria-00119287</idno>
            <idno type="halBibtex">buse:inria-00119287</idno>
            <idno type="halRefHtml">&lt;i&gt;Mathematics of Computation&lt;/i&gt;, 2009, 78 (265), pp.345--386</idno>
            <idno type="halRef">Mathematics of Computation, 2009, 78 (265), pp.345--386</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-179534-579538"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNICE">Université Nice Sophia Antipolis</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-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
            <idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
            <idno type="stamp" n="DIEUDONNE">Laboratoire Jean-Alexandre Dieudonné</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="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UNIV-COTEDAZUR">Université Côte d'Azur</idno>
            <idno type="stamp" n="INRIA-300009">Inria 300009</idno>
          </seriesStmt>
          <notesStmt>
            <note type="description">Preprint</note>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Explicit factors of some iterated resultants and discriminants</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Laurent</forename>
                    <surname>Busé</surname>
                  </persName>
                  <email type="md5">1d07661f1fc93eb2d468ccf689fe5810</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">laurent-buse</idno>
                  <idno type="idhal" notation="numeric">180598</idno>
                  <idno type="halauthorid" notation="string">2107-180598</idno>
                  <idno type="IDREF">https://www.idref.fr/074519786</idno>
                  <idno type="ORCID">https://orcid.org/0009-0005-6528-7027</idno>
                  <orgName ref="#struct-300009"/>
                  <affiliation ref="#struct-2461"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Bernard</forename>
                    <surname>Mourrain</surname>
                  </persName>
                  <email type="md5">99d2b72427e88e39557fd123d18bb4ee</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">bernard-mourrain</idno>
                  <idno type="idhal" notation="numeric">397</idno>
                  <idno type="halauthorid" notation="string">15487-397</idno>
                  <idno type="IDREF">https://www.idref.fr/050178725</idno>
                  <affiliation ref="#struct-2461"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">16936</idno>
                <idno type="issn">0025-5718</idno>
                <idno type="eissn">1088-6842</idno>
                <title level="j">Mathematics of Computation</title>
                <imprint>
                  <publisher>American Mathematical Society</publisher>
                  <biblScope unit="volume">78</biblScope>
                  <biblScope unit="issue">265</biblScope>
                  <biblScope unit="pp">345--386</biblScope>
                  <date type="datePub">2009</date>
                </imprint>
              </monogr>
              <idno type="arxiv">cs/0612050</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-sc">Computer Science [cs]/Symbolic Computation [cs.SC]</classCode>
              <classCode scheme="halDomain" n="math.math-ac">Mathematics [math]/Commutative Algebra [math.AC]</classCode>
              <classCode scheme="halDomain" n="math.math-ag">Mathematics [math]/Algebraic Geometry [math.AG]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into irreducible factors of several constructions involving two times iterated univariate resultants and discriminants over the integer universal ring of coefficients of the entry polynomials. Cases involving from two to four generic polynomials and resultants or discriminants in one of their variables are treated. The decompositions into irreducible factors we get are obtained by exploiting fundamental properties of the univariate resultants and discriminants and induction on the degree of the polynomials. As a consequence, each irreducible factor can be separately and explicitly computed in terms of a certain multivariate resultant. With this approach, we also obtain as direct corollaries some results conjectured by Collins and McCallum which correspond to the case of polynomials whose coefficients are themselves generic polynomials in other variables. Finally, a geometric interpretation of the algebraic factorization of the iterated discriminant of a single polynomial is detailled.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-2461" status="OLD">
          <idno type="RNSR">200218407D</idno>
          <orgName>Geometry, algebra, algorithms</orgName>
          <orgName type="acronym">GALAAD</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-34586" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-117617" type="direct"/>
            <relation name="UMR6621" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-34586" status="VALID">
          <idno type="RNSR">198318250R</idno>
          <idno type="ROR">https://ror.org/01nzkaw91</idno>
          <orgName>Centre Inria d'Université Côte d'Azur</orgName>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles BP 93 06902 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/sophia/</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="institution" xml:id="struct-117617" status="VALID">
          <idno type="IdRef">026403498</idno>
          <idno type="ISNI">0000000123372892</idno>
          <idno type="ROR">https://ror.org/02k9vew78</idno>
          <orgName>Université Nice Sophia Antipolis (1965 - 2019)</orgName>
          <orgName type="acronym">UNS</orgName>
          <date type="start">1965-10-23</date>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 06100 Nice</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://unice.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>
    </back>
  </text>
</TEI>