On fractal patterns in Ulam words

MaRDI QIDQ6418484zbMATH OpenFDO

Authors Andrei Mandelshtam

Publication date 23 November 2022

Abstract: We show that already a seemingly simple set of Ulam words $unicodex2013$ those with two $1$'s $unicodex2013$ possess an intricate intrinsic structure. We create a logarithmic-time algorithm to determine whether any given such word is Ulam, uncovering properties such as biperiodicity and various parity conditions, as well as sharp bounds on the number of $0$'s outside the two $1$'s. We also discover and prove that sets of Ulam words indexed by the number $y$ of $0$'s between the two $1$'s have an inherent dual hierarchical structure, determined by the arithmetic properties of $y.$ In particular, this allows us to construct an infinite family of self-similar fractals $ildeU(y)$ indexed by the set of $2$-adic integers $y,$ containing for example the outward Sierpinski gasket as $ildeU(-1).$

This page was built for publication: On fractal patterns in Ulam words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6418484)