Exact Three-Symbol Density Hales–Jewett Numbers in Dimensions Seven Through Ten

We determine the exact three-symbol density Hales–Jewett numbers in dimensions seven through ten: c(7,3) = 1302, c(8,3) = 3780, c(9,3) = 11340, and c(10,3) = 32864. Here c(n,3) is the maximum cardinality of a subset of the ternary cube containing no combinatorial line. These construction sizes were previously known; the contribution is matching upper bounds for arbitrary subsets, together with ordinary Lean proofs. The dimension-nine upper bound follows by coordinate slicing from dimension eight. The accompanying proof supplement contains explicit witnesses, complete selected proof dependencies, pinned public Lean and Mathlib versions, and verification instructions. Verification does not require the proprietary discovery implementation.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-29
DOI
https://doi.org/10.5281/zenodo.23758502
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Exact Three-Symbol Density Hales–Jewett Numbers in Dimensions Seven Through Ten

Mohit Mahajan
1 links
Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
preprint

Exact Three-Symbol Density Hales–Jewett Numbers in Dimensions Seven Through Ten

Mohit Mahajan
preprint en

Abstract

We determine the exact three-symbol density Hales–Jewett numbers in dimensions seven through ten: c(7,3) = 1302, c(8,3) = 3780, c(9,3) = 11340, and c(10,3) = 32864. Here c(n,3) is the maximum cardinality of a subset of the ternary cube containing no combinatorial line. These construction sizes were previously known; the contribution is matching upper bounds for arbitrary subsets, together with ordinary Lean proofs. The dimension-nine upper bound follows by coordinate slicing from dimension eight. The accompanying proof supplement contains explicit witnesses, complete selected proof dependencies, pinned public Lean and Mathlib versions, and verification instructions. Verification does not require the proprietary discovery implementation.

Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon