F-sets and finite automata

The classical notion of a k-automatic subset of the natural numbers is here extended to that of an F-automatic subset of an arbitrary finitely generated abelian group $\Gamma$ equipped with an arbitrary endomorphism F. This is applied to the isotrivial positive characteristic Mordell-Lang context where F is the Frobenius action on a commutative algebraic group G over a finite field, and $\Gamma$ is a finitely generated F-invariant subgroup of G. It is shown that the F-subsets of $\Gamma$ introduced by the second author and Scanlon are F-automatic. It follows that when G is semiabelian and X is a closed subvariety then X intersect $\Gamma$ is F-automatic. Derksen's notion of a k-normal subset of the natural numbers is also here extended to the above abstract setting, and it is shown that F-subsets are F-normal. In particular, the X intersect $\Gamma$ appearing in the Mordell-Lang problem are F-normal. This generalises Derksen's Skolem-Mahler-Lech theorem to the Mordell-Lang context.Comment: The final section is revised following an error discovered by Christopher Hawthorne; it is no longer claimed that an F-normal subset has a finite symmetric difference with an F-subset. The main theorems of the paper remain unchange

3x+13x+1 inverse orbit generating functions almost always have natural boundaries

The $3x+k$ function $T_{k}(n)$ sends $n$ to $(3n+k)/2$ resp. $n/2,$ according as $n$ is odd, resp. even, where $k \equiv \pm 1~(\bmod \, 6)$. The map $T_k(\cdot)$ sends integers to integers, and for $m \ge 1$ let $n \rightarrow m$ mean that $m$ is in the forward orbit of $n$ under iteration of $T_k(\cdot).$ We consider the generating functions $f_{k,m}(z) = \sum_{n>0, n \rightarrow m} z^{n},$ which are holomorphic in the unit disk. We give sufficient conditions on $(k,m)$ for the functions $f_{k, m}(z)$ have the unit circle $\{|z|=1\}$ as a natural boundary to analytic continuation. For the $3x+1$ function these conditions hold for all $m \ge 1$ to show that $f_{1,m}(z)$ has the unit circle as a natural boundary except possibly for $m= 1, 2, 4$ and $8$. The $3x+1$ Conjecture is equivalent to the assertion that $f_{1, m}(z)$ is a rational function of $z$ for the remaining values $m=1,2, 4, 8$.Comment: 15 page

On the set of zero coefficients of a function satisfying a linear differential equation

Let $K$ be a field of characteristic zero and suppose that $f:\mathbb{N}\to K$ satisfies a recurrence of the form $$f(n)\ =\ \sum_{i=1}^d P_i(n) f(n-i),$$ for $n$ sufficiently large, where $P_1(z),...,P_d(z)$ are polynomials in $K[z]$. Given that $P_d(z)$ is a nonzero constant polynomial, we show that the set of $n\in \mathbb{N}$ for which $f(n)=0$ is a union of finitely many arithmetic progressions and a finite set. This generalizes the Skolem-Mahler-Lech theorem, which assumes that $f(n)$ satisfies a linear recurrence. We discuss examples and connections to the set of zero coefficients of a power series satisfying a homogeneous linear differential equation with rational function coefficients.Comment: 11 page