2008
DOI: 10.1016/j.jalgebra.2007.04.015
|View full text |Cite
|
Sign up to set email alerts
|

FA-presentable groups and rings

Abstract: We consider structures which are FA-presentable. It is known that an FA-presentable finitely generated group is virtually abelian; we strengthen this result by showing that an arbitrary FA-presentable group is locally virtually abelian. As a consequence, we prove that any FA-presentable ring is locally finite; this is a significant restriction and allows us to say a great deal about the structure of FA-presentable rings. In particular, we show that any FA-presentable ring with identity and no zero divisors is … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
5
4

Relationship

2
7

Authors

Journals

citations
Cited by 28 publications
(20 citation statements)
references
References 17 publications
0
20
0
Order By: Relevance
“…Theorem 3.8 ( [22]). Suppose that (N, +) r is weakly FA-presentable with alphabet Σ and k states; then r ≤ (k + 1) log 2 |Σ|.…”
Section: More Examplesmentioning
confidence: 99%
“…Theorem 3.8 ( [22]). Suppose that (N, +) r is weakly FA-presentable with alphabet Σ and k states; then r ≤ (k + 1) log 2 |Σ|.…”
Section: More Examplesmentioning
confidence: 99%
“…Even if one considers simpler algebraic structures such as groups, the definition is still too restrictive: Oliver and Thomas [13] observed, as a consequence of Gromov's theorem about finitely generated groups of polynomial growth and a theorem of Romanovskiȋ classifying the virtually polycyclic groups with decidable first order theory, that a finitely generated group has an automatic presentation (in the sense of Definition 1) iff it is virtually abelian. This was extended by Nies and Thomas [12] who showed that every finitely generated subgroup of an automatically presentable group is virtually abelian.…”
Section: Introductionmentioning
confidence: 92%
“…Finally, we refer the reader to the articles of Blumensath and Grädel [2], Delhommé [6], Khoussainov and Minnes [14], Khoussainov and Nerode [16], Kuske [18] and Rubin [24,25] for the background and open questions in the area of automatic structures. For simple and non-trivial examples of word-automatic structures we refer to the articles of Ishihara, Khoussainov and Rubin [11], Nies [22], Nies and Thomas [23] and Stephan [28].…”
Section: Basic Definitionsmentioning
confidence: 99%