arXiv (All)
open access
Generation of Iterated Wreath Products Constructed from Full Transformation Monoids and Symmetric Groups
The rank of a semigroup is the cardinality of a smallest generating set. In this paper, we introduce iterated wreath products of transformation semigroups. We determine the rank of iterated wreath products of full transformation monoids and symmetric groups.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Generalized free wreath products and their operator algebras#665376
- On the Self-Similarity of Permutational Wreath Products and Their Embedding into Finitely Presented Simple Groups#822289
- Grün's Lemma for Semiassociative Mal'cev Algebras#1129985
- Green languages and growth of free inverse monoids#1129845
- Polynomiality for algebras of invariants associated with some Inönü-Wigner contractions in type A#821141
Record · ID 1034337
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive