First polyform counts on the Josehedron honeycomb
The polyforms of the Josehedron honeycomb are enumerated for the first time, in three symmetry classes, all published in the OEIS: A398957 (fixed), A398958 (one-sided) and A398959 (free).
A recent preprint introduced a new space-filling solid. This entry records the first enumeration of the shapes buildable from its honeycomb, verified several independent ways before submission.
- Plain: Plain version: no notation, everyday words
- Applied: Applied version: the method, the cost, and what transfers
- Technical: Technical version: full notation, definitions, and prior bounds
Figures, dates, citations and caveats are identical in every reading; only the words around them change.
The result
The Josehedron is a solid with faces of the Josehedron (four triangles and eight quadrilaterals)
faces, introduced
this spring, that fills space with copies of itself. This entry records the
first counts of the shapes you can build by gluing its cells together
face-to-face: at largest cluster size enumerated on the Josehedron honeycomb
cells there are
one-sided 11-cell polyforms of the Josehedron honeycomb
one-sided shapes and
free 11-cell polyforms of the Josehedron honeycomb
shapes when mirror images are also identified.
Think of a jigsaw made from one oddly-shaped block that happens to pack
perfectly with copies of itself (a new one, described for the first time this
spring). A natural question for any such block: how many different shapes can you
make by sticking 2, 3, 4… of them together? (For flat squares this is the
classic pentominoes puzzle.) Nobody had counted these for the new block, so we
did, up to largest cluster size enumerated on the Josehedron honeycomb
blocks, where there are
already one-sided 11-cell polyforms of the Josehedron honeycomb
distinct shapes. Before
publishing, the counts were checked several separate ways: completely different programs had
to agree on every number; the same program had to reproduce the long-known
answers for ordinary cubes; and the block's geometry itself was rebuilt with
exact fraction arithmetic so no rounding error could hide anywhere.
Polyform enumeration on the Voronoi honeycomb of the Josehedron plesiohedron
(Bernhard, arXiv:2604.07160): six cell types, each with
faces of the Josehedron (four triangles and eight quadrilaterals)
face-neighbours, point group of order
order of the Josehedron honeycomb point group (half proper, half improper; the tiling is achiral)
, achiral tiling. Fixed, one-sided and
free counts through n = largest cluster size enumerated on the Josehedron honeycomb
(free class at
the top order: free 11-cell polyforms of the Josehedron honeycomb
). Isomorph rejection by
canonical hashing over the translation quotient; the identity
one-sided = 2·free − achiral holds at every term with small nonnegative achiral
counts. Verification: independent reimplementation,
cubic-control anchors (A001931/A000162/A038119, exact across the range), and an exact
rational halfspace re-derivation of the adjacency replacing the floating
Voronoi construction. OEIS: A398957 (fixed), A398958 (one-sided) and A398959
(free) are all published, the fixed class on 2026-08-27.
The method is the transferable part: to count objects on a novel substrate,
first pin the substrate with exact arithmetic (the adjacency here was rebuilt
from integer cell centres with rational halfspace clipping, no library Voronoi
in the trust chain), then anchor the counter on a solved neighbouring problem
(the cubic lattice, known for decades) before believing any new number. The
enumeration itself is a standard Redelmeier walk; every guarantee comes from
the anchors around it. Cost: the full run to
n = largest cluster size enumerated on the Josehedron honeycomb
is hours on a laptop; the
verification scaffolding is what took the care.
Limitations
Counts end at n = largest cluster size enumerated on the Josehedron honeycomb
(the next order
costs roughly an order of magnitude more). The
underlying solid is Bernhard's; only the enumeration is ours.
How this was checked
cross implementation
Independently written enumerators (a C++ Redelmeier-style counter and a Python growth-and-canonical-hash counter) agree on every term of every class in the shared range.
Aug 14, 2026
known value anchor
Run on the simple cubic honeycomb, the same enumerator reproduces the published cubic sequences A001931, A000162 and A038119 exactly across the anchor range.
Aug 14, 2026
independent reproduction
The honeycomb cell adjacency, originally built with a floating-point Voronoi library, was re-derived by an exact rational-arithmetic halfspace construction with no floating point: the facet signature, symmetric adjacency, lattice volume, and an independent fixed-count enumeration all match the banked values across the anchor range.
Aug 14, 2026
Revision history
- 2026-08-27 · status-change
A398957, the fixed class, published after an editor round (the process comment came out and the verified self-contained enumerator went up as an a-file). The family is now complete and live; source: PROGRAM_LEDGER.md, entry dated 2026-08-27.
- 2026-08-15 · created
Written the day A398958 and A398959 published; A398957 (fixed class) still in review.
How to cite this
Tyler Satchel Orden (2026). First polyform counts on the Josehedron honeycomb. Checkable. https://cyborgmathematics.com /results/josehedron-polyforms (updated August 15, 2026)
No DOI yet. Cite the URL and the date; this page carries a revision history so a dated citation stays meaningful.
BibTeX
@misc{orden2026josehedronpolyforms,
author = {Tyler Satchel Orden},
title = {First polyform counts on the Josehedron honeycomb},
year = {2026},
howpublished = {Checkable},
url = {https://cyborgmathematics.com
/results/josehedron-polyforms}
}