Projects per year
Abstract
For a semigroup S its d-sequence is d(S) = (d1, d2, d3, . . .), where di is the smallest number of elements needed to generate the ith direct power of S. In this paper we present a number of facts concerning the type of growth d(S) can have when S is an infinite semigroup, comparing them with the corresponding known facts for infinite groups, and also for finite groups and semigroups.
Original language | English |
---|---|
Pages (from-to) | 116-130 |
Journal | Semigroup Forum |
Volume | 84 |
Issue number | 1 |
Early online date | 5 Nov 2011 |
DOIs | |
Publication status | Published - 2012 |
Keywords
- Semigroup
- Monoid
- Direct power
- Generating set
Fingerprint
Dive into the research topics of 'On the growth of generating sets for direct powers of semigroups'. Together they form a unique fingerprint.Projects
- 1 Finished
-
Automata Languages Decidability: Automata, Languages, Decidability in Algebra
Ruskuc, N. (PI) & Quick, M. (CoI)
1/03/10 → 31/05/14
Project: Standard