Duality of graded graphs through operads

DOI10.1007/s00026-021-00529-4zbMath1483.18023arXiv2004.12230OpenAlexW3149940163MaRDI QIDQ2033471

Samuele Giraudo

Publication date: 17 June 2021

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2004.12230

zbMATH Keywords

latticetreeposetnonsymmetric operaddual graded graph

Mathematics Subject Classification ID

Trees (05C05) Combinatorics of partially ordered sets (06A07) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Operads (general) (18M60)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Pluriassociative algebras. I: The pluriassociative operad.
• The algebra of binary search trees
• Dual graded graphs for Kac-Moody algebras
• Compatible associative products and trees
• Duality of graded graphs
• Cofree Hopf algebras.
• On some anticyclic operads
• Colored operads, series on colored operads, and combinatorial generating systems
• Combinatorial operads from monoids
• \(H\)-spaces from a homotopy point of view
• Set Operads in Combinatorics and Computer Science
• On the structure of cofree Hopf algebras
• Differential Posets
• Term Rewriting and All That
• The Hook Graphs of the Symmetric Group
• Algebraic Operads
• Dialgebras and related operads
• Nonsymmetric operads in combinatorics

This page was built for publication: Duality of graded graphs through operads