subword complexity 2aperiodicity 1binary expansion 1combinatorial number theory 1formal verification 1lean-4 1nearest-integer rounding 1powers of three 1steering word 1
From the 2 of 2 linked papers with an AI index.
2 papers
math.CO2026
Aperiodicity and subword complexity in the binary expansion of powers of three
Ralf Stephan
The paper studies the binary representation of powers of three, showing that deviations from any fixed periodic pattern occur roughly like log m / log log m and that the low-order…
math.NT2026
Superlinear complexity of the steering word
Ralf Stephan
The paper proves that the subword complexity of the steering word generated by rounding the orbit of the map x↦3/2 x is superlinear, using results from the Subspace Theorem and for…