IFS with Memory

Gaskets by Forbidden Triples

Comparing with the sixth section of the background, the only other obvious choise is to set to 0 all entries in the first row.

From the software description, we see that setting to 0 all the entries in the first row forbids all triples 1 → i → j.

Consequently, all length 2 address squares have corner 1 empty, with no other forbidden combinations. This gives a gasket in each of the 16 length 2 address squares.

Return to Sample.