F-sets and finite automata

DOI10.5802/JTNB.1070MaRDI QIDQ2199490zbMATH OpenOpenAlexFDO

Authors Jason P. Bell, Rahim Moosa

Publication date 11 September 2020

Published in Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NoDerivs 4.0 International

Full work available at URL https://arxiv.org/abs/1712.03800

zbMATH Keywords

\(F\)-setsautomatics setspositive characteristic Mordell-Langsemiabelian varietiesSkolem-Mahler-Lech

Mathematics Subject Classification ID

Automata sequences (11B85) Positive characteristic ground fields in algebraic geometry (14G17) Group schemes (14L15)

Abstract: 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.

Review text

The notion of a \(k\)-automatic subset of \(\mathbb{N}\) (that is, a subset \(S\subset\mathbb{N}\) with the property that there is a finite automaton which accepts exactly the words arising as base \(k\) expansions of elements of \(S\)) is extended here to an \(F\)-automatic subset of a finitely generated abelian group \(\Gamma\) equipped with an endomorphism \(F\). An \(F\)-subset means a finite union of finite sets of sums of elements of \(\Gamma\), of \(F\)-invariant subgroups in \(\Gamma\), and of \(F\)-cycles in \(\Gamma\) (subsets of the form \(\{\gamma+F^\delta\gamma+F^{2\delta}\gamma+\cdots +F^{\ell\delta}\gamma\}\) with \(\ell,\delta\in\mathbb{N}\) and \(\gamma\in\Gamma\)). \(F\)-automaticity is also defined via finite-state automata and accepted words. The main results (Theorems 4.2, 6.9 and 7.4) prove automaticity of \(F\)-subsets under some mild conditions. The results are a natural generalisations of Derksen's analog of the Skolem-Mahler-Lech theorem [\textit{H. Derksen}, Invent. Math. 168, No. 1, 175--224 (2007; Zbl 1205.11030)] to the Mordell-Lang context studied by \textit{R. Moosa} and \textit{T. Scanlon} [Am. J. Math. 126, No. 3, 473--522 (2004; Zbl 1072.03020)].

Recommendations

• On vanishing coefficients of algebraic power series over fields of positive characteristic
• On automatic subsets of the Gaussian integers
• Automatic sets of rational numbers
• F -structures and integral points on semiabelian varieties over finite fields
• k-automatic sets of rational numbers

Cites work

• A generalised Skolem-Mahler-Lech theorem for affine varieties
• A GENERALISED SKOLEM–MAHLER–LECH THEOREM FOR AFFINE VARIETIES
• A Skolem-Mahler-Lech theorem in positive characteristic and finite automata
• Automatic Sequences
• Bounded Regular Sets
• Characterizing regular languages with polynomial densities
• Division points on subvarieties of isotrivial semi-abelian varieties
• F -structures and integral points on semiabelian varieties over finite fields
• Finding the growth rate of a regular or context-free language in polynomial time
• scientific article; zbMATH DE number 3808970 (Why is no real title available?)
• scientific article; zbMATH DE number 3978429 (Why is no real title available?)
• scientific article; zbMATH DE number 721811 (Why is no real title available?)
• scientific article; zbMATH DE number 2220973 (Why is no real title available?)
• On vanishing coefficients of algebraic power series over fields of positive characteristic
• The isotrivial case in the Mordell-Lang Theorem
• The Mordell-Lang conjecture for function fields

Cited in

(9)

• Support of an algebraic series as the range of a recursive sequence
• A refinement of Christol's theorem for algebraic power series
• Automata and tame expansions of \((\mathbb{Z}, +)\)
• Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
• CONTRIBUTIONS TO THE THEORY OF F-AUTOMATIC SETS
• Quantitative estimates for the size of an intersection of sparse automatic sets
• A characterization of algebraic multivariate power series with sparse support
• Effective isotrivial Mordell-Lang in positive characteristic
• Descriptive set theoretic methods in automata theory. Decidability and topological complexity

This page was built for publication: \(F\)-sets and finite automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199490)