Free dendriform algebras. I: A parenthesis setting.
Leroux, Philippe (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Inversion of integral series enumerating planar trees.”
Free dendriform algebras. I: A parenthesis setting.
Hook length formulas for trees by Han's expansion.
Chen, William Y.C., Gao, Oliver X.Q., Guo, Peter L. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A simple symmetry generating operads related to rooted planar -ary trees and polygonal numbers.
Leroux, Philippe (2007)
Journal of Integer Sequences [electronic only]
Similarity:
On Catalan trees and the Jacobian conjecture.
Singer, Dan (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees.
Seo, Seunghyun (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Combinatorial interpretation of generalized Stirling numbers.
Lang, Wolfdieter (2009)
Journal of Integer Sequences [electronic only]
Similarity:
A simple bijection between binary trees and colored ternary trees.
Sun, Yidong (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Analysis of some statistics for increasing tree families.
Panholzer, Alois, Prodinger, Helmut (2004)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
A combinatorial derivation of the number of labeled forests.
Callan, David (2003)
Journal of Integer Sequences [electronic only]
Similarity:
Bijective proofs of identities from colored binary trees.
Yan, Sherry H.F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sets with two associative operations
Teimuraz Pirashvili (2003)
Open Mathematics
Similarity:
In this paper we consider duplexes, which are sets with two associative binary operations. Dimonoids in the sense of Loday are examples of duplexes. The set of all permutations carries a structure of a duplex. Our main result asserts that it is a free duplex with an explicitly described set of generators. The proof uses a construction of the free duplex with one generator by planary trees.
Almost all trees have an even number of independent sets.
Wagner, Stephan G. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the rules for the elimination of the non-canonical Morgan trees
Damir Vukičević (2009)
Kragujevac Journal of Mathematics
Similarity: