Counting Berg partitions via Sturmian words and substitution tilings
Counting Berg partitions via Sturmian words and substitution tilings
We develop the connection of Berg partitions with special substitution tilings of two tiles. We obtain a new proof that the number of Berg partitions with a fi xed connectivity matrix is equal to half of the sum of its entries, \[12]. This approach together with the formula of Seebold …