<?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-03427179v2</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-17T07:38:02+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">The art of algorithmic guessing in gfun</title>
            <author role="aut">
              <persName>
                <forename type="first">Sergey</forename>
                <surname>Yurkevich</surname>
              </persName>
              <email type="md5">d0898f90ef103a72b37d7454e973d446</email>
              <email type="domain">univie.ac.at</email>
              <idno type="idhal" notation="numeric">1086593</idno>
              <idno type="halauthorid" notation="string">2114618-1086593</idno>
              <affiliation ref="#struct-211984"/>
              <affiliation ref="#struct-1096341"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Sergey</forename>
                <surname>Yurkevich</surname>
              </persName>
              <email type="md5">d0898f90ef103a72b37d7454e973d446</email>
              <email type="domain">univie.ac.at</email>
            </editor>
            <funder ref="#projanr-50512"/>
            <funder>DOC fellowship of the ÖAW (26101)</funder>
            <funder>OeAD (FR 09/2021)</funder>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2021-11-13 00:25:09</date>
            </edition>
            <edition n="v2" type="current">
              <date type="whenSubmitted">2022-09-07 14:57:14</date>
              <date type="whenWritten">2022-08-01</date>
              <date type="whenModified">2025-02-26 15:22:03</date>
              <date type="whenReleased">2022-09-07 15:24:55</date>
              <date type="whenProduced">2022-09-05</date>
              <date type="whenEndEmbargoed">2022-09-07</date>
              <ref type="file" target="https://inria.hal.science/hal-03427179v2/document">
                <date notBefore="2022-09-07"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-03427179v2/file/YurkevichMT.pdf" id="file-3771599-3298288">
                <date notBefore="2022-09-07"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="996756">
                <persName>
                  <forename>Sergey</forename>
                  <surname>Yurkevich</surname>
                </persName>
                <email type="md5">d0898f90ef103a72b37d7454e973d446</email>
                <email type="domain">univie.ac.at</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03427179</idno>
            <idno type="halUri">https://inria.hal.science/hal-03427179</idno>
            <idno type="halBibtex">yurkevich:hal-03427179</idno>
            <idno type="halRefHtml">&lt;i&gt;Maple Transactions&lt;/i&gt;, 2022, 2 (1), pp.14421. &lt;a target="_blank" href="https://dx.doi.org/10.5206/mt.v2i1.14421"&gt;&amp;#x27E8;10.5206/mt.v2i1.14421&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Maple Transactions, 2022, 2 (1), pp.14421. &amp;#x27E8;10.5206/mt.v2i1.14421&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-3771599-3298288"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <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="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="ANR">ANR</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
          </seriesStmt>
          <notesStmt>
            <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">The art of algorithmic guessing in gfun</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Sergey</forename>
                    <surname>Yurkevich</surname>
                  </persName>
                  <email type="md5">d0898f90ef103a72b37d7454e973d446</email>
                  <email type="domain">univie.ac.at</email>
                  <idno type="idhal" notation="numeric">1086593</idno>
                  <idno type="halauthorid" notation="string">2114618-1086593</idno>
                  <affiliation ref="#struct-211984"/>
                  <affiliation ref="#struct-1096341"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">240646</idno>
                <idno type="eissn">2564-3029</idno>
                <title level="j">Maple Transactions</title>
                <imprint>
                  <publisher>Western Libraries Western University</publisher>
                  <biblScope unit="volume">2</biblScope>
                  <biblScope unit="issue">1</biblScope>
                  <biblScope unit="pp">14421</biblScope>
                  <date type="datePub">2022-09-05</date>
                  <date type="dateEpub">2022-09-05</date>
                </imprint>
              </monogr>
              <idno type="doi">10.5206/mt.v2i1.14421</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="math">Mathematics [math]</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>The technique of guessing can be very fruitful when dealing with sequences which arise in practice. This holds true especially when guessing is performed algorithmically and efficiently. One highly useful tool for this purpose is the package named gfun in the software Maple. In this text we explore and explain some of gfun's possibilities and illustrate them on two examples from recent mathematical research by the author and his collaborators.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <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-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="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>
      </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>
      </listOrg>
    </back>
  </text>
</TEI>