Sets with two associative operations (Q1407182): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0301248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of the Malvenuto-Reutenauer Hopf algebra of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2736579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetree. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order structure on the algebra of permutations and of planar binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4656995 / rank
 
Normal rank

Latest revision as of 10:55, 6 June 2024

scientific article
Language Label Description Also known as
English
Sets with two associative operations
scientific article

    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references