Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.25543

An explicit half-flip family of 32-modular Hadamard matrices at L = 3 mod 8: structural placement and mod-tower analysis

Michel Kulhandjian
View original source ↗Read source document ↗Export metadata ↓

Abstract

Motivated by Eliahou's 64-modular Hadamard construction at the smallest open Hadamard order n=668, we introduce an explicit half-flip family of 32-modular Hadamard matrices at orders n=4L for L = 3 (mod 8). A master identity reduces the four-sequence Golay-quadruple condition under the half-flip ansatz (s, s*, sq, (sq)*) to a single-sequence type-restricted autocorrelation c_k^tau(s). The construction yields a closed-form expression for c_k^tau, a true Hadamard matrix at L=11, and 32-modular matrices at every L = 3 (mod 8), including the open orders n=716 and n=1132. Existence of 32-modular at L = 3 (mod 4) is due to Eliahou-Kervaire (2001); Eliahou's 2026 follow-up in J. Algebraic Combin. gives 64-modular matrices at L = 3 (mod 16) and L = 7 (mod 32) via the same ansatz and correlation identity we call the master identity, subsuming our construction on that residue subclass. Our contribution is therefore primarily structural. Applying Barrera Acevedo-O Cathain-Dietrich (2019) and Alvarez et al. (2020), the family is non-cocyclic over any group at every prime L in {11, 19, 59} in the YES set, yet pseudococyclic over the Goethals-Seidel Moufang loop GS_{4L} at every L. A half-flip H-set decomposition theorem parameterizes the symmetric difference of any two family elements by a single sequence flip set, giving the family the structure of a length-L Hamming cube. A symbolic mod-tower verifier (mod-8 is F_2-linear) classifies true Hadamards in the family through k=14 (L <= 115): the YES set is empirically bounded by k=7, refuting four H4 predictions and excluding L in {179, 283} within the ansatz. A Grobner basis at L=11 exhibits a previously unrecorded even-T0-block linear identity. All code and JSON certificates: github.com/michelkulhandjian/hadamard-halfflip-structural

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michel Kulhandjian. 2026-09-22. An explicit half-flip family of 32-modular Hadamard matrices at L = 3 mod 8: structural placement and mod-tower analysis. https://arxiv.org/abs/2609.25543

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO↗
arXiv2026

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO↗
arXiv2026

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO↗