Constructing set-operads from monoids (Q447872): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2769058226 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1208.0922 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Axiomatic homotopy theory for operads / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3549563 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2736579 / rank | |||
Normal rank |
Latest revision as of 15:26, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Constructing set-operads from monoids |
scientific article |
Statements
Constructing set-operads from monoids (English)
0 references
30 August 2012
0 references
Let \(M\) be a monoid. Let \(TM(n)\) be the collection of formal words of length \(n\) on the elements of \(M\). The author observes that the collection of these sets \(TM(n)\), \(n\in\mathbb N\), forms a symmetric operad naturally associated to \(M\). He then studies suboperads of the operad \(TM\) associated to the monoids \(M = \mathbb N^k\), \(k = 1,2,3\). He proves that usual word collections occurring in algebraic combinatorics (like endofunctions, parking functions, and other collections of words specified by growth constraints in \(\mathbb N\)), are identified with suboperads of these operads \(TM\).
0 references
monoids
0 references
combinatorial operads
0 references