Abstract: Hitomezashi patterns, which originate from traditional Japanese embroidery, are intricate arrangements of unit-length line segments called stitches. The stitches connect to form hitomezashi strands and hitomezashi loops, which divide the plane into regions. We investigate the deeper mathematical properties of these patterns, which also feature prominently in the study of corner percolation. It was previously known that every loop in a hitomezashi pattern has odd width and odd height. We additionally prove that such a loop has length congruent to modulo and area congruent to modulo . Although these results are simple to state, their proofs require us to understand the delicate topological and combinatorial properties of slicing operations that can be applied to hitomezashi patterns. We also show that the expected number of regions in a random hitomezashi pattern (chosen according to a natural random model) is asymptotically .
Recommendations
Cites work
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
- Corner percolation on \(\mathbb Z^{2}\) and the square root of 17
- Enumerating 2D percolation series by the finite-lattice method: theory
- Extensions of hitomezashi patterns
- scientific article; zbMATH DE number 687006 (Why is no real title available?)
- On two-dimensional percolation
- Statistics of lattice animals (polyominoes) and polygons
Cited in
(4)
This page was built for publication: Loops and regions in Hitomezashi patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6080150)