Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Wessel, Mieke"'
Autor:
Wessel, Mieke
We give a new graph-theoretic proof of Cobham's Theorem which says that the support of an automatic sequence is either sparse or grows at least like $N^\alpha$ for some $\alpha > 0$. The proof uses the notions of tied vertices and cycle arboressences
Externí odkaz:
http://arxiv.org/abs/2405.11385
Autor:
Wessel, Mieke
We prove some new instances of a conjecture of Bachoc, Couvreur and Z\'emor that generalizes Freiman's $3k-4$ Theorem to a multiplicative version in a function field setting. As a consequence we find that if $F$ is a rational function field over an a
Externí odkaz:
http://arxiv.org/abs/2405.10724