Showing 2024Show all
2 papers · 1 filter
math.CO2024
The reflection complexity of sequences over finite alphabets
Jean-Paul Allouche, John M. Campbell, Shuo Li +2
In combinatorics on words, the well-studied factor complexity function $ρ_{\infw{x}}$ of a sequence $\infw{x}$ over a finite alphabet counts, for every nonnegative integer , the…
math.NT2024
A binary version of the Mahler-Popken complexity function
John M. Campbell
The (Mahler-Popken) complexity of a natural number is the smallest number of ones that can be used via combinations of multiplication and addition to express , wit…