Sets of universal sequences for the symmetric group and analogous semigroups
From MaRDI portal
Publication:5221335
Abstract: A universal sequence for a group or semigroup is a sequence of words such that for any sequence , the equations , , can be solved simultaneously in . For example, Galvin showed that the sequence is universal for the symmetric group Sym when is infinite, and Sierpi'nski showed that is universal for the monoid of functions from the infinite set to itself. In this paper, we show that under some conditions, the set of universal sequences for the symmetric group on an infinite set is independent of the cardinality of . More precisely, we show that if is any set such that , then every universal sequence for Sym is also universal for Sym. If , then the converse also holds. It is shown that an analogue of this theorem holds in the context of inverse semigroups, where the role of the symmetric group is played by the symmetric inverse monoid. In the general context of semigroups, the full transformation monoid is the natural analogue of the symmetric group and the symmetric inverse monoid. If and are arbitrary infinite sets, then it is an open question as to whether or not every sequence that is universal for is also universal for . However, we obtain a sufficient condition for a sequence to be universal for which does not depend on the cardinality of . A large class of sequences satisfy this condition, and hence are universal for for every infinite set .
Recommendations
Cites work
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- Are Primitive Words Universal for Infinite Symmetric Groups?
- Classes of universal words for the infinite symmetric groups
- GENERATING INFINITE SYMMETRIC GROUPS
- Generating Countable Sets of Permutations
- Generating countable sets of surjective functions.
- Generation of infinite factorizable inverse monoids.
- Infinite dual symmetric inverse monoids
- Infinite partition monoids.
- On representing words in the automorphism group of the random graph
- On the universality of systems of words in permutation groups
- Problem list from: Algebras, lattices and varieties: a conference in honor of Walter Taylor, University of Colorado, 15--18 August, 2004
- Representations of Infinite Permutations by Words
- Representations of infinite permutations by words (II)
- Some Remarks on Commutators
- Some Universal Sets of Terms
- Sur l'approximation des fonctions continues par les superpositions de quatre fonctions
- Sur les suites infinies de fonctions définies dans les ensembles quelconques
- Sur un théorème de M. Sierpiński
- The Bergman property for semigroups
- The decision problem for equational bases of algebras
- Turbulence, amalgamation, and generic automorphisms of homogeneous structures
- Universal sequences for the order-automorphisms of the rationals
Cited in
(4)
This page was built for publication: Sets of universal sequences for the symmetric group and analogous semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221335)