Constructing set-operads from monoids (Q447872): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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\). | |||
Property / review text: 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\). / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Benoit Fresse / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 18D50 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 08A50 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 06A07 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6073969 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
monoids | |||
Property / zbMATH Keywords: monoids / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
combinatorial operads | |||
Property / zbMATH Keywords: combinatorial operads / rank | |||
Normal rank |
Revision as of 10:31, 30 June 2023
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