Sets with two associative operations (Q1407182)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1978730
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sets with two associative operations |
scientific article; zbMATH DE number 1978730 |
Statements
Sets with two associative operations (English)
0 references
6 January 2004
0 references
The author considers sets equipped with two associative binary operations, calling such a structure a duplex. Relevant examples of duplexes are dimonoids, defined by \textit{J.-L. Loday} [C. R. Acad. Sci., Paris, Sér. I 321, No. 2, 141-146 (1995; Zbl 0845.16036)]. An example of a duplex which is not a dimonoid is given by using permutations. A free duplex generated by a given set is constructed via planar trees. Duplexes coming from planar binary trees and vertices of cubes are discussed.
0 references
planar trees
0 references
permutations
0 references
free algebras
0 references
dimonoids
0 references
free duplexes
0 references
0 references
0 references
0 references
0.85088885
0 references
0 references
0 references
0 references
