<?xml version='1.0' encoding='utf-8'?>
<?xml-stylesheet type="text/xsl" href="/v2/static/oai2.xsl"?>
<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-10-06T16:50:52Z</responseDate>
  <request identifier="oai:figshare.com:article/34012974" metadataPrefix="oai_dc" verb="GetRecord">https://api.figshare.com/v2/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:figshare.com:article/34012974</identifier>
        <datestamp>2026-09-28T21:40:34Z</datestamp>
        <setSpec>category_29836</setSpec>
        <setSpec>item_type_12</setSpec>
        <setSpec>month_year_09_2026</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"  xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Exact Boundary Layers for Integer Two-Level Sections of the Nine-Cube</dc:title>
          <dc:creator>Akihiro Koide (24791941)</dc:creator>
          <dc:subject>Combinatorics and discrete mathematics (excl. physical combinatorics)</dc:subject>
          <dc:subject>Boolean cube</dc:subject>
          <dc:subject>integer two-level section</dc:subject>
          <dc:subject>Littlewood–Offord problem</dc:subject>
          <dc:subject>affine rank</dc:subject>
          <dc:subject>exact enumeration</dc:subject>
          <dc:subject>computer-assisted classification</dc:subject>
          <dc:description>&lt;p dir="ltr"&gt;An integer two-level section of the Boolean cube is the set on which a primitive, noncoordinate integer linear functional takes one of two consecutive integer values. We study intersections whose defining normal directions are pairwise nonparallel. In dimension nine, the largest intersection size strictly below 50% of the cube’s vertices is 194 for nine defining directions, 193 for ten, and 192 for every larger number. We describe all extremizers: the 194-point layer has twenty-two signed-coordinate orbits, the 193-point layer has seventeen, and the 192-point layer with at least eleven available defining directions has eight. The first two layers have full affine span and a unique pair or point whose deletion lowers affine rank; the resulting 192-point core determines an explicit canonical representation. The minimum numbers of defining sections are respectively five through seven and six through eight. The proof combines integer coefficient bounds, quadratic vanishing spaces, nonnegative relations among receiver quadratics, and complete finite intersection calculations. All orbit representatives are given explicitly, together with the complete finite carrier families of the full-span models. The coefficient and presentation bounds reduce the completeness assertions to finite computations.&lt;/p&gt;&lt;p dir="ltr"&gt;&lt;br&gt;&lt;/p&gt;&lt;p dir="ltr"&gt;This deposit contains the manuscript PDF, LaTeX source, and computation supplement. The supplement provides exact representative verifiers, 37 standalone C++20 enumeration programs, finite catalogues and retained computation outputs, a proof guide, and a regeneration driver. Representative verification checks the listed models and their properties; completeness combines the finite-domain reductions in the manuscript with the complete enumeration calculations.&lt;/p&gt;</dc:description>
          <dc:date>2026-09-28T21:40:34Z</dc:date>
          <dc:type>Text</dc:type>
          <dc:type>Preprint</dc:type>
          <dc:identifier>10.6084/m9.figshare.34012974.v1</dc:identifier>
          <dc:relation>https://figshare.com/articles/preprint/Exact_Boundary_Layers_for_Integer_Two-Level_Sections_of_the_Nine-Cube/34012974</dc:relation>
          <dc:rights>CC BY 4.0</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
