<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-08-21T18:34:57Z</responseDate>
  <request identifier="27482" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:27482</identifier>
        <datestamp>2026-08-21T14:42:41Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>When Darwin Met Ianus: Dichotomies of Expressivity</dc:title>
          <dc:creator>Brunar, Johanna</dc:creator>
          <dc:creator>Pinsker, Michael</dc:creator>
          <dc:creator>Schöbi, Moritz</dc:creator>
          <dc:subject>Constraint Satisfaction Problem (CSP)</dc:subject>
          <dc:subject>Temporal Constraint language</dc:subject>
          <dc:subject>Phylogeny Constraint language</dc:subject>
          <dc:subject>pseudo-loop</dc:subject>
          <dc:subject>primitive positive interpretation</dc:subject>
          <dc:subject>polymorphism</dc:subject>
          <dc:subject>oligomorphic permutation group</dc:subject>
          <dc:subject>identity</dc:subject>
          <dc:description>The classifications of temporal and phylogeny constraint languages stand among the most seminal complexity classifications within infinite-domain Constraint Satisfaction Problems (CSPs), yet remain the most mysterious in terms of algorithms and algebraic invariants for the tractable cases. We show that those languages which do not pp-construct EVERYTHING (and thus by the classifications are solvable in polynomial time) have, in fact, very limited expressive power as measured by the graphs and hypergraphs they can pp-interpret. This limitation yields many previously unknown algebraic consequences, while also providing new, uniform proofs for known invariance properties. In particular, we show that such temporal and phylogeny constraint languages admit 4-ary pseudo-Siggers polymorphisms - a result that sustains the possibility that the existence of such polymorphisms extends to the much broader context of the Bodirsky-Pinsker conjecture. Although temporal and phylogeny constraint languages appear to follow fundamentally different algorithmic principles, our proofs reveal a common core and proceed along strikingly similar lines.&#13;
&#13;
When Ianus can't express it all&#13;
He tries in vain, he hits a wall&#13;
When for 𝕂₃ no way he knows&#13;
His face of pseudo-loops he shows.&#13;
As Darwin finds such twisted edge&#13;
To pines and vines he makes this pledge:&#13;
"Should free of pseudo-loops you shine&#13;
All finite structures shall be thine!"</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Johanna Brunar and Michael Pinsker and Moritz Schöbi</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 386, 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.MFCS.2026.100</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-274824</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2026.100</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
