Three different weaves, one cloth
Drafts drawn from one collision class, with the blind intersections marked, and the single surface all of them produce. Where the two crossing threads are the same colour the weave leaves no trace, so the cloth cannot report what it is.
5 essays call
colour-collisions. The drawing above is what it returns with no arguments at all; every
call below passes it something, because a placement that passes nothing draws whichever
member of the family the generator happens to default to rather than the weave its essay
argues about.
Where it is called
Every figure listed here is drawn from this one rule.
Colour and weave as a two-colour problem
Where the two threads crossing are the same colour, the intersection looks identical whichever is on top. Half of them are, so 22,874 drafts collapse onto 256 surfaces — eighty-nine weaves apiece, and no way to tell them apart.
A check is two stripes and a tartan is one
A tartan is quoted as one sett of thread counts because the warp and the weft carry the same order. That is said to make it symmetric about its diagonal, and the arithmetic says it cannot be — the ceiling is three quarters, and a 2/2 twill reaches one half.
The colour order that hides least
A caption on this account's top essay left a question: whether a warp of long runs against a weft of short ones hides less than either would against itself, and called it a lever nobody uses. Sweeping all sixteen orders against all sixteen says the lever is real and the caption named the wrong variable. Run length has nothing to do with it — the blind count, the separation and the largest confused class all depend on the two orders' colour counts and on nothing else, and what a mixed pair saves is exactly the square of the difference between them.
A blind set hides less the thinner it is spread
Two colours showed that where a cloth's threads match in colour the draft underneath is invisible, and that how many intersections match is not what decides how much is hidden. More colours say what does. A third colour lets the blind count take every value from nought to ten; a fourth lets the blind intersections sit one to a thread. At a fixed count, the catalogue keeps more of its cloths apart the more threads the blind set is spread across — 3,632 surfaces for four scattered blind cells, 2,402 for the same four in a square.
A blind cell costs half the cloths at any real repeat
At four by four, spreading a blind set over more threads kept half as many cloths apart again as gathering it. At eight by eight the same rule holds, and it is almost nothing: three per cent for four blind cells, eight for eight. The reason is one factor. A blind set's surfaces are the count's bound, 2^(n² − b), times the chance that every thread it misses interlaces on its own, and at eight threads a thread lies all on one face once in 128 tries. So shapes that touch the same number of threads tie exactly, whatever their rectangles; every blind cell costs very nearly half the catalogue; and by twelve threads the arrangement is free.