It is shown that graph convolution extends the regime in which the data is linearly separable by a factor of roughly 1/ √ D, where D is the expected degree of a node, as compared to the mixture model data on its own.Expand

In this thesis, we extend the notion of k-automatic sequences to Ostrowski-automatic sequences. We develop a procedure for computationally deciding certain combinatorial and enumeration questions… Expand

Lower bounds on the repetition threshold of infinite rich words over 2 and 3-letter alphabets are addressed, and a candidate infinite rich word over the alphabet is constructed with a small critical exponent of $2+\sqrt{2}/2$.Expand

This work proves that the smallest possible critical exponent of an infinite balanced word over a 5-letter alphabet is $3/2$ using a formulation of first-order logic, the Pell number system, and a machine computation based on finite-state automata.Expand