Free dendriform algebras. I: A parenthesis setting.
Leroux, Philippe (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “Sets with two associative operations”
Free dendriform algebras. I: A parenthesis setting.
Inversion of integral series enumerating planar trees.
Loday, Jean-Louis (2005)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
On Catalan trees and the Jacobian conjecture.
Singer, Dan (2001)
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:
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 combinatorial proof of Postnikov's identity and a generalized enumeration of labeled trees.
Seo, Seunghyun (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On binary trees and permutations
A. Panayotopoulos, A. Sapounakis (1992)
Mathématiques et Sciences Humaines
Similarity:
Every binary tree is associated to a permutation with repetitions, which determines it uniquely. Two operations are introduced and used for the construction of the set of all binary trees. The set of all permutations which correspond to a given binary tree is determined and its cardinal number is evaluated.
NP-completeness of minimal width unordered tree layout.
Marriott, Kim, Stuckey, Peter J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
A simple bijection between binary trees and colored ternary trees.
Sun, Yidong (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Combinatorics of the free Baxter algebra.
Aguiar, Marcelo, Moreira, Walter (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A bijective proof of Garsia's -Lagrange inversion theorem.
Singer, Dan W. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Edit distance between unlabeled ordered trees
Anne Micheli, Dominique Rossin (2006)
RAIRO - Theoretical Informatics and Applications
Similarity:
There exists a bijection between one-stack sortable permutations (permutations which avoid the pattern ) and rooted plane trees. We define an edit distance between permutations which is consistent with the standard edit distance between trees. This one-to-one correspondence yields a polynomial algorithm for the subpermutation problem for pattern-avoiding permutations. Moreover, we obtain the generating function of the edit distance between ordered unlabeled trees and some special ones. For...