<?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-00789806v2</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-29T17:11:55+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Every totally real algebraic integer is a tree eigenvalue</title>
            <author role="aut">
              <persName>
                <forename type="first">Justin</forename>
                <surname>Salez</surname>
              </persName>
              <email type="md5">97022ed723fff217b3b71a37160251eb</email>
              <email type="domain">univ-paris-diderot.fr</email>
              <idno type="idhal" notation="string">justin-salez</idno>
              <idno type="idhal" notation="numeric">2772</idno>
              <idno type="halauthorid" notation="string">20056-2772</idno>
              <idno type="IDREF">https://www.idref.fr/157297640</idno>
              <affiliation ref="#struct-102"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Justin</forename>
                <surname>Salez</surname>
              </persName>
              <email type="md5">5a3dd5841b318527933059a155fb6a8c</email>
              <email type="domain">dauphine.psl.eu</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2013-02-18 18:29:48</date>
            </edition>
            <edition n="v2" type="current">
              <date type="whenSubmitted">2014-09-04 14:40:53</date>
              <date type="whenWritten">2013-02-18</date>
              <date type="whenModified">2025-09-29 13:19:45</date>
              <date type="whenReleased">2014-09-04 20:41:22</date>
              <date type="whenProduced">2015-03</date>
              <date type="whenEndEmbargoed">2014-09-04</date>
              <ref type="file" target="https://hal.science/hal-00789806v2/document">
                <date notBefore="2014-09-04"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-00789806v2/file/draft.pdf" id="file-1060889-863899">
                <date notBefore="2014-09-04"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1302.4423"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="136961">
                <persName>
                  <forename>Justin</forename>
                  <surname>Salez</surname>
                </persName>
                <email type="md5">5a3dd5841b318527933059a155fb6a8c</email>
                <email type="domain">dauphine.psl.eu</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00789806</idno>
            <idno type="halUri">https://hal.science/hal-00789806</idno>
            <idno type="halBibtex">salez:hal-00789806</idno>
            <idno type="halRefHtml">&lt;i&gt;Journal of Combinatorial Theory, Series B&lt;/i&gt;, 2015, 111, pp.249-256. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.jctb.2014.09.001"&gt;&amp;#x27E8;10.1016/j.jctb.2014.09.001&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Journal of Combinatorial Theory, Series B, 2015, 111, pp.249-256. &amp;#x27E8;10.1016/j.jctb.2014.09.001&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1060889-863899"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-PARIS7" corresp="UNIV-PARIS">Université Denis Diderot - Paris VII</idno>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <idno type="stamp" n="PMA" corresp="SORBONNE-UNIVERSITE">Laboratoire de Probabilités et Modèles Aléatoires</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INSMI">CNRS-INSMI - INstitut des Sciences Mathématiques et de leurs Interactions</idno>
            <idno type="stamp" n="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="LPSM" corresp="SORBONNE-UNIVERSITE">Laboratoire de Probabilités, Statistique et Modélisation</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="UNIV-PARIS">Université Paris Cité</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</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">Every totally real algebraic integer is a tree eigenvalue</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Justin</forename>
                    <surname>Salez</surname>
                  </persName>
                  <email type="md5">97022ed723fff217b3b71a37160251eb</email>
                  <email type="domain">univ-paris-diderot.fr</email>
                  <idno type="idhal" notation="string">justin-salez</idno>
                  <idno type="idhal" notation="numeric">2772</idno>
                  <idno type="halauthorid" notation="string">20056-2772</idno>
                  <idno type="IDREF">https://www.idref.fr/157297640</idno>
                  <affiliation ref="#struct-102"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">15253</idno>
                <idno type="issn">0095-8956</idno>
                <idno type="eissn">1096-0902</idno>
                <title level="j">Journal of Combinatorial Theory, Series B</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">111</biblScope>
                  <biblScope unit="pp">249-256</biblScope>
                  <date type="datePub">2015-03</date>
                </imprint>
              </monogr>
              <idno type="arxiv">1302.4423</idno>
              <idno type="doi">10.1016/j.jctb.2014.09.001</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">adjacency matrix</term>
                <term xml:lang="en">eigenvalue</term>
                <term xml:lang="en">totally real algebraic integer</term>
                <term xml:lang="en">tree</term>
              </keywords>
              <classCode scheme="classification">MSC: 05C05, 05C25, 05C31,05C50</classCode>
              <classCode scheme="halDomain" n="math.math-co">Mathematics [math]/Combinatorics [math.CO]</classCode>
              <classCode scheme="halDomain" n="math.math-pr">Mathematics [math]/Probability [math.PR]</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>Graph eigenvalues are examples of totally real algebraic integers, i.e. roots of real-rooted monic polynomials with integer coefficients. Conversely, the fact that every totally real algebraic integer occurs as an eigenvalue of some finite graph is a deep result, conjectured forty years ago by Hoffman, and proved seventeen years later by Estes. This short paper provides an independent and elementary proof of a stronger statement, namely that the graph may actually be chosen to be a tree. As a by-product, our result implies that the atoms of the limiting spectrum of $n\times n$ symmetric matrices with independent Bernoulli$\,\left(\frac{c}{n}\right)$ entries ($c&gt;0$ is fixed as $n\to\infty$) are exactly the totally real algebraic integers. This settles an open problem raised by Ben Arous (2010).</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-102" status="OLD">
          <idno type="RNSR">199712645M</idno>
          <orgName>Laboratoire de Probabilités et Modèles Aléatoires</orgName>
          <orgName type="acronym">LPMA</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.proba.jussieu.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93591" type="direct"/>
            <relation active="#struct-300301" type="direct"/>
            <relation name="UMR7599" 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="institution" xml:id="struct-300301" status="OLD">
          <idno type="IdRef">027542084</idno>
          <idno type="ISNI">0000000121514068</idno>
          <idno type="ROR">https://ror.org/02n7qrg46</idno>
          <orgName>Université Paris Diderot - Paris 7</orgName>
          <orgName type="acronym">UPD7</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>5 rue Thomas-Mann - 75205 Paris cedex 13</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-paris-diderot.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>