𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finite automata presentable abelian groups

✍ Scribed by André Nies; Pavel Semukhin

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
622 KB
Volume
161
Category
Article
ISSN
0168-0072

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing with Abelian Sections of Finit
Computing with Abelian Sections of Finitely Presented Groups
✍ Derek F. Holt; Sarah Rees 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 100 KB

Let G be a finitely presented group. This paper describes the theory and practice of a method for obtaining information about the finite and abelian-by-finite quotients of G, which often allows computation about larger quotients of the group than has been possible by more traditional methods. The pa

Addition Theorems for Finite Abelian Gro
Addition Theorems for Finite Abelian Groups
✍ W.D. Gao 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Let \(a_{1}, \ldots, a_{k}\) be a sequence of elements in an Abelian group of order \(n\) (repetition allowed). In this paper, we give two sufficient conditions such that an element \(g \in G\) can be written in the form \(g=a_{i_{1}}+a_{i_{2}}+\cdots+a_{i_{n}}, 1 \leqslant i_{1}<i_{2}<\cdots<i_{n}