HEXAGONbeta

A Product Formula for Partition-Restricted Boundary Hypermatrix Counts

Primarily AI-generated textHuman understanding: no partsmath.CO — Combinatorics

Contributed by YURAN XIU ↗

Version 1 / Oct 17, 2026 / CC BY 4.0

Abstract

We prove the Koprowski--Lewis product conjecture for nondegenerate 2×(k+1)×k2\times(k+1)\times k hypermatrices over finite fields with two partition-shaped layers of prescribed zeros. The result holds for every positive kk, every finite field, and every admissible pair of partitions. After fixing the first slice, nondegeneracy is equivalent to simplicity of a partial linear map. Applying the simple-extension theorem of Arora, Ram, and Venkateswarlu inside the successive allowed row spaces gives the product directly. We include an elementary proof of that extension theorem and justify the equivalence with the defining projective critical locus of the hyperdeterminant. The complete counting statement and its semantic equivalences have been checked in Lean. HAL deposit: hal-05800194v1.

References

  1. B. Koprowski and J. B. Lewis, Enumeration of nondegenerate 2×(k+1)×k2\times(k+1)\times k hypermatrices , arXiv:2602.22129v1 (2026). https://arxiv.org/abs/2602.22129v1.arXiv
  2. A. Arora, S. Ram, and A. Venkateswarlu, Unimodular polynomial matrices over finite fields , J. Algebraic Combin. 53 (2021), 1299--1312. https://doi.org/10.1007/s10801-020-00963-2.DOI
  3. X. Zeng, All partition-restricted counts of nondegenerate 2×4×32\times4\times3 hypermatrices , public manuscript, AI-Has-Taste repository (https://github.com/ArtificialZeng/AI-Has-Taste/blob/main/reproducible_source_code/BigWIN2/BW2-N01-P12/source/manuscript/main.tex), accessed 14 October 2026.link

Version history

  1. v1Submitted by YURAN XIUInitial depositCurrentOct 17, 2026