<?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-07-23T14:47:00Z</responseDate>
  <request identifier="16580" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:16580</identifier>
        <datestamp>2024-03-06T10:57:51Z</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>High-Dimensional Expanders from Chevalley Groups</dc:title>
          <dc:creator>O'Donnell, Ryan</dc:creator>
          <dc:creator>Pratt, Kevin</dc:creator>
          <dc:subject>High-dimensional expanders</dc:subject>
          <dc:subject>simplicial complexes</dc:subject>
          <dc:subject>group theory</dc:subject>
          <dc:description>Let Φ be an irreducible root system (other than G₂) of rank at least 2, let 𝔽 be a finite field with p = char 𝔽 &gt; 3, and let G(Φ,𝔽) be the corresponding Chevalley group. We describe a strongly explicit high-dimensional expander (HDX) family of dimension rank(Φ), where G(Φ,𝔽) acts simply transitively on the top-dimensional faces; these are λ-spectral HDXs with λ → 0 as p → ∞. This generalizes a construction of Kaufman and Oppenheim (STOC 2018), which corresponds to the case Φ = A_d. Our work gives three new families of spectral HDXs of any dimension ≥ 2, and four exceptional constructions of dimension 4, 6, 7, and 8.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Ryan O'Donnell and Kevin Pratt</dc:contributor>
          <dc:date>2022</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 234, 37th Computational Complexity Conference (CCC 2022)</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.CCC.2022.18</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-165802</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2022.18</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>
