Enclave Depth in Hitomezashi Stitchery

Year: 2024 Authors: D. Jacob Wildstrom

Core claim

Hitomezashi patterns have a provable upper bound on enclave depth, and random bitstring-generated designs almost surely realize deep enclaves as size grows.

Topics

hitomezashi, enclave depth, nested regions, random patterns

Domains

combinatorics, probability, percolation, discrete geometry, textile art, embroidery, sashiko, weaving

Methods

formal definition, proof, probabilistic bound, pattern analysis

Media

bitstrings, canvas, running stitches, AA weaving

Source status

This page publishes metadata and extracted analytical signals only. Raw PDF and full OCR text are kept local for now.