Unextendible sequences in finite abelian groups.
Let be a unimodular Pisot substitution over a letter alphabet and let be the associated Rauzy fractals. In the present paper we want to investigate the boundaries () of these fractals. To this matter we define a certain graph, the so-called contact graph of . If satisfies a combinatorial condition called the super coincidence condition the contact graph can be used to set up a self-affine graph directed system whose attractors are certain pieces of the boundaries . From this graph...
Let A and B be finite sets in a commutative group. We bound |A+hB| in terms of |A|, |A+B| and h. We provide a submultiplicative upper bound that improves on the existing bound of Imre Ruzsa by inserting a factor that decreases with h.