The converse characterization of bases for asymptotically automatic sequences

About 3 years old · traced to

Let VV be a vector subspace of ⨁i=1∞Q\bigoplus_{i=1}^\infty \mathbb{Q}. For a prime pp, let νp\nu_p denote the pp-adic valuation, and let p1,p2,…p_1,p_2,\dots be the increasing enumeration of the primes. Converse basis conjecture. There exists a sequence a\mathbf a over the alphabet {0,1}\{0,1\} such that, for every k∈Nk\in\mathbb{N} with k>1k>1, a\mathbf a is asymptotically kk-automatic if and only if

(νp1(k),νp2(k),… )∈V.(\nu_{p_1}(k),\nu_{p_2}(k),\dots)\in V.

Corollary 1.5 gives the forward structural implication for every sequence; this conjecture asks whether every vector subspace can occur as the set of bases of a binary sequence. Its status is not resolved in the supplied source.

References

Primary source

Jakub Konieczny, “On asymptotically automatic sequences”, arXiv:2305.09885 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.