An 'Experimental Mathematics' Approach to Stolarsky Interspersions via Automata Theory

TL;DR

This paper applies automata theory to analyze Stolarsky interspersions, enabling verification of existing results and proving new properties within these mathematical arrays.

Contribution

It introduces automata-theoretic methods to study Stolarsky interspersions, providing a novel approach for verification and discovery in this area.

Findings

Automata theory effectively verifies known properties of Stolarsky interspersions.

New results on the structure of Wythoff arrays are proved using automata.

The approach simplifies complex proofs in the study of interspersions.

Abstract

We look at the Stolarsky interspersions (such as the Wythoff array) one more time, this time using tools from automata theory. These tools allow easy verification of many of the published results on these arrays, as well as proofs of new results.