<?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-03462575</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-16T18:15:24+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Counting embeddings of rooted trees into families of rooted trees</title>
            <author role="aut">
              <persName>
                <forename type="first">Bernhard</forename>
                <surname>Gittenberger</surname>
              </persName>
              <idno type="halauthorid">210294-0</idno>
              <affiliation ref="#struct-19098"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Zbigniew</forename>
                <surname>Gołębiewski</surname>
              </persName>
              <idno type="halauthorid">941938-0</idno>
              <affiliation ref="#struct-461233"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Isabella</forename>
                <surname>Larcher</surname>
              </persName>
              <idno type="halauthorid">1670053-0</idno>
              <affiliation ref="#struct-19098"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Małgorzata</forename>
                <surname>Sulkowska</surname>
              </persName>
              <email type="md5">b40bbf193836bfe76d2580052d2afcaa</email>
              <email type="domain">pwr.edu.pl</email>
              <idno type="idhal" notation="numeric">1119043</idno>
              <idno type="halauthorid" notation="string">1051713-1119043</idno>
              <affiliation ref="#struct-461233"/>
              <affiliation ref="#struct-211142"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Małgorzata</forename>
                <surname>Sulkowska</surname>
              </persName>
              <email type="md5">b40bbf193836bfe76d2580052d2afcaa</email>
              <email type="domain">pwr.edu.pl</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2021-12-03 11:22:50</date>
              <date type="whenModified">2026-02-23 15:28:02</date>
              <date type="whenReleased">2021-12-06 16:44:19</date>
              <date type="whenProduced">2022-09-09</date>
              <date type="whenEndEmbargoed">2021-12-03</date>
              <ref type="file" target="https://hal.science/hal-03462575v1/document">
                <date notBefore="2021-12-03"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-03462575v1/file/tree_embeddings.pdf" id="file-3464455-3038636">
                <date notBefore="2021-12-03"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/2008.08312"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="1106711">
                <persName>
                  <forename>Małgorzata</forename>
                  <surname>Sulkowska</surname>
                </persName>
                <email type="md5">b40bbf193836bfe76d2580052d2afcaa</email>
                <email type="domain">pwr.edu.pl</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03462575</idno>
            <idno type="halUri">https://hal.science/hal-03462575</idno>
            <idno type="halBibtex">gittenberger:hal-03462575</idno>
            <idno type="halRefHtml">2022, pp.1-34</idno>
            <idno type="halRef">2022, pp.1-34</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-3464455-3038636"/></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="I3S">Laboratoire d'Informatique, Signaux et Systèmes de Sophia-Antipolis</idno>
            <idno type="stamp" n="INRIASO">INRIA-SOPHIA</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="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="LARA">LARA</idno>
            <idno type="stamp" n="UNIV-COTEDAZUR">Université Côte d'Azur</idno>
            <idno type="stamp" n="TEST-HALCNRS">Collection test HAL CNRS</idno>
            <idno type="stamp" n="TEST-NICE">test nice</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">Counting embeddings of rooted trees into families of rooted trees</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Bernhard</forename>
                    <surname>Gittenberger</surname>
                  </persName>
                  <idno type="halauthorid">210294-0</idno>
                  <affiliation ref="#struct-19098"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Zbigniew</forename>
                    <surname>Gołębiewski</surname>
                  </persName>
                  <idno type="halauthorid">941938-0</idno>
                  <affiliation ref="#struct-461233"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Isabella</forename>
                    <surname>Larcher</surname>
                  </persName>
                  <idno type="halauthorid">1670053-0</idno>
                  <affiliation ref="#struct-19098"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Małgorzata</forename>
                    <surname>Sulkowska</surname>
                  </persName>
                  <email type="md5">b40bbf193836bfe76d2580052d2afcaa</email>
                  <email type="domain">pwr.edu.pl</email>
                  <idno type="idhal" notation="numeric">1119043</idno>
                  <idno type="halauthorid" notation="string">1051713-1119043</idno>
                  <affiliation ref="#struct-461233"/>
                  <affiliation ref="#struct-211142"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">746</idno>
                <idno type="eissn">1077-8926</idno>
                <title level="j">The Electronic Journal of Combinatorics</title>
                <imprint>
                  <publisher>Open Journal Systems</publisher>
                  <biblScope unit="volume">29</biblScope>
                  <biblScope unit="issue">3</biblScope>
                  <biblScope unit="pp">1-34</biblScope>
                  <date type="datePub">2022-09-09</date>
                </imprint>
              </monogr>
              <idno type="arxiv">2008.08312</idno>
              <idno type="doi">10.37236/10760</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</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="REPORT">Reports</classCode>
              <classCode scheme="halOldTypology" n="REPORT">Reports</classCode>
              <classCode scheme="halTreeTypology" n="REPORT.RESREPORT">Reports - Research report</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The number of embeddings of a partially ordered set $S$ in a partially ordered set $T$ is the number of subposets of $T$ isomorphic to $S$. If both, $S$ and $T$, have only one unique maximal element, we define good embeddings as those in which the maximal elements of $S$ and $T$ overlap. We investigate the number of good and all embeddings of a rooted poset $S$ in the family of all binary trees on $n$ elements considering two cases: plane (when the order of descendants matters) and non-plane. Furthermore, we study the number of embeddings of a rooted poset $S$ in the family of all planted plane trees of size $n$. We derive the asymptotic behaviour of good and all embeddings in all cases and we prove that the ratio of good embeddings to all is of the order $\Theta(1/\sqrt{n})$ in all cases, where we provide the exact constants. Furthermore, we show that this ratio is non-decreasing with $S$ in the plane binary case and asymptotically non-decreasing with $S$ in the non-plane binary case and in the planted plane case. Finally, we comment on the case when $S$ is disconnected.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-19098" status="VALID">
          <idno type="IdRef">030036496</idno>
          <idno type="ROR">https://ror.org/04d836q62</idno>
          <orgName>Vienna University of Technology = Technischen Universität Wien</orgName>
          <orgName type="acronym">TU Wien</orgName>
          <desc>
            <address>
              <addrLine>Karlsplatz 13, 1040 Vienna</addrLine>
              <country key="AT"/>
            </address>
            <ref type="url">https://www.tuwien.at/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-461233" status="VALID">
          <idno type="ROR">https://ror.org/008fyn775</idno>
          <orgName>Wroclaw University of Science and Technology = Politechnika Wroclawska [Wrocław]</orgName>
          <desc>
            <address>
              <addrLine>27 Wybrzeże Wyspiańskiego St50-370 Wrocław</addrLine>
              <country key="PL"/>
            </address>
            <ref type="url">http://pwr.edu.pl/en/</ref>
          </desc>
        </org>
        <org type="researchteam" xml:id="struct-211142" status="VALID">
          <idno type="RNSR">201322124W</idno>
          <idno type="ROR">https://ror.org/02mab7455</idno>
          <orgName>Combinatorics, Optimization and Algorithms for Telecommunications</orgName>
          <orgName type="acronym">COATI</orgName>
          <date type="start">2013-01-01</date>
          <date type="end">2026-04-30</date>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France)</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/coati</ref>
          </desc>
          <listRelation>
            <relation active="#struct-34586" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-451999" type="direct"/>
            <relation active="#struct-13009" type="indirect"/>
            <relation active="#struct-117617" type="indirect"/>
            <relation name="UMR7271" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1039632" type="indirect"/>
          </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="department" xml:id="struct-451999" status="VALID">
          <orgName>COMmunications, Réseaux, systèmes Embarqués et Distribués</orgName>
          <orgName type="acronym">Laboratoire I3S - COMRED</orgName>
          <date type="start">2016-03-02</date>
          <desc>
            <address>
              <addrLine>Laboratoire I3SCS 4012106903 Sophia Antipolis Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.i3s.unice.fr/comred</ref>
          </desc>
          <listRelation>
            <relation active="#struct-13009" type="direct"/>
            <relation active="#struct-117617" type="indirect"/>
            <relation name="UMR7271" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1039632" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-13009" status="VALID">
          <idno type="IdRef">050320491</idno>
          <idno type="ISNI">0000000105613840</idno>
          <idno type="RNSR">201220432L</idno>
          <idno type="ROR">https://ror.org/01215r597</idno>
          <orgName>Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis</orgName>
          <orgName type="acronym">I3S</orgName>
          <desc>
            <address>
              <addrLine>2000, route des Lucioles - Les Algorithmes - bât. Euclide B 06900 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.i3s.unice.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-117617" type="direct"/>
            <relation name="UMR7271" active="#struct-441569" type="direct"/>
            <relation active="#struct-1039632" type="direct"/>
          </listRelation>
        </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>
        <org type="regroupinstitution" xml:id="struct-1039632" status="VALID">
          <idno type="IdRef">241035694</idno>
          <idno type="ROR">https://ror.org/019tgvf94</idno>
          <orgName>Université Côte d'Azur</orgName>
          <orgName type="acronym">UniCA</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 28, avenue Valrose 06108 Nice Cedex 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://univ-cotedazur.fr</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>