arXiv math/04073122004-07-18math.GRmath.CO

The smallest Mealy automaton of intermediate growth

Laurent Bartholdi, Illya I. Reznykov, Vitaly I. Sushchansky

发表信息：: J. Algebra 295 (2006), no. 2, 387--414
DOI：: 10.1016/j.jalgebra.2004.08.040

英文摘要：

In this paper we study the smallest Mealy automaton of intermediate growth, first considered by the last two authors. We describe the automatic transformation monoid it defines, give a formula for the generating series for its (ball volume) growth function, and give sharp asymptotics for its growth function, namely [ F(n) \sim 2^{5/2} 3^{3/4} π^{-2} n^{1/4} \exp{π\sqrt{n/6}} ] with the ratios of left- to right-hand side tending to 1 as $n \to \infty$.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable

We prove that a semigroup generated by a reversible two-state Mealy automaton is either finite or free of rank 2. This fact leads to the decidability of finiteness for groups generated by two-state or two-letter invertible-reversible Mealy automata and to the decidability of freeness for semigroups generated by two-state invertible-reversible Mealy automata.

2013-10-22cs.FLmath.GR

A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group

The class of automaton groups is a rich source of the simplest examples of infinite Burnside groups. However, there are some classes of automata that do not contain such examples. For instance, all infinite Burnside automaton groups in the literature are generated by non reversible Mealy automata and it was recently shown that 2-state invertible-reversible Mealy automata cannot generate infinite Burnside groups. Here we extend this result to connected 3-state invertible-reversible Mealy automata, using new original techniques. The results provide the first uniform method to construct elements …

2014-09-22cs.FLmath.GR

The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet

For every natural number $n$, we classify abelian groups generated by an $n$-state time-varying automaton over the binary alphabet, as well as by an $n$-state Mealy automaton over the binary alphabet.

2016-07-26math.GR

Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups

The simplest example of an infinite Burnside group arises in the class of automaton groups. However there is no known example of such a group generated by a reversible Mealy automaton. It has been proved that, for a connected automaton of size at most~3, or when the automaton is not bireversible, the generated group cannot be Burnside infinite. In this paper, we extend these results to automata with bigger stateset, proving that, if a connected reversible automaton has a prime number of states, it cannot generate an infinite Burnside group.

2016-04-12cs.FLmath.GR

Solenoid Maps, Automatic Sequences, Van Der Put Series, and Mealy-Moore Automata

The ring $\mathbb Z_d$ of $d$-adic integers has a natural interpretation as the boundary of a rooted $d$-ary tree $T_d$. Endomorphisms of this tree (i.e. solenoid maps) are in one-to-one correspondence with 1-Lipschitz mappings from $\mathbb Z_d$ to itself and automorphisms of $T_d$ constitute the group $\mathrm{Isom}(\mathbb Z_d)$. In the case when $d=p$ is prime, Anashin showed that $f\in\mathrm{Lip}^1(\mathbb Z_p)$ is defined by a finite Mealy automaton if and only if the reduced coefficients of its van der Put series constitute a $p$-automatic sequence over a finite subset of $\mathbb Z_p\…

2020-06-03cs.FLmath.GR

On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata

This paper addresses the torsion problem for a class of automaton semigroups, defined as semigroups of transformations induced by Mealy automata, aka letter-by-letter transducers with the same input and output alphabet. The torsion problem is undecidable for automaton semigroups in general, but is known to be solvable within the well-studied class of (semi)groups generated by invertible bounded Mealy automata. We focus on the somehow antipodal class of invertible reversible Mealy automata and prove that for a wide subclass the generated semigroup is torsion-free.

2014-12-02cs.FLmath.GR

更多相关论文收起更多论文

To Infinity and Beyond

We prove that if a group generated by a bireversible Mealy automaton contains an element of infinite order, its growth blows up and is necessarily exponential. As a direct consequence, no infinite virtually nilpotent group can be generated by a bireversible Mealy automaton.

2017-09-04cs.FLmath.GR

An analogue to Dixon's theorem for automaton groups

Dixon's famous theorem states that the group generated by two random permutations of a finite set is generically either the whole symmetric group or the alternating group. In the context of random generation of finite groups this means that it is hopeless to wish for a uniform distribution -- or even a non-trivial one -- by drawing random permutations and looking at the generated group. Mealy automata are a powerful tool to generate groups, including all finite groups and many interesting infinite ones, whence the idea of generating random finite groups by drawing random Mealy automata. In thi…

2016-10-11cs.DMcs.FLmath.GR

生成自由群的自相似群的动力学与阻碍

Freeness Obstructions for Self-Similar Groups Acting on Rooted Trees

Università degli Studi Niccolò Cusano（尼古拉·库萨诺大学）；Politecnico di Milano（米兰理工大学）

该研究证明自相似群自由性的两个一般阻碍，推导自动机群相关结论，明确自由性与双可逆性的关联，回答Grigorchuk问题并扩展Sidki的相关结果。

2026-08-18math.GR

On level-transitivity and exponential growth

We prove that if the group generated by a Mealy automaton acts level-transitively on a regular rooted tree, then the semigroup generated by the dual automaton has exponential growth, hence giving a decision procedure of exponential growth for a restricted family of automaton semigroups.

2016-08-17cs.FLmath.GR