On the distribution of depths in increasing trees.
Kuba, Markus, Wagner, Stephan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Combinatorics of the free Baxter algebra.”
On the distribution of depths in increasing trees.
Superization and -specialization in combinatorial Hopf algebras.
Novelli, Jean-Christophe, Thibon, Jean-Yves (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:
Free dendriform algebras. I: A parenthesis setting.
Leroux, Philippe (2006)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On Catalan trees and the Jacobian conjecture.
Singer, Dan (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Recursive generation of -ary trees.
Manes, K., Sapounakis, A., Tasoulas, I., Tsikouras, P. (2009)
Journal of Integer Sequences [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.
Splaying a search tree in preorder takes linear time.
Chaudhuri, R., Höft, H. (1991)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A bijective proof of Garsia's -Lagrange inversion theorem.
Singer, Dan W. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Categorification of Hopf algebras of rooted trees
Joachim Kock (2013)
Open Mathematics
Similarity:
We exhibit a monoidal structure on the category of finite sets indexed by P-trees for a finitary polynomial endofunctor P. This structure categorifies the monoid scheme (over Spec ℕ) whose semiring of functions is (a P-version of) the Connes-Kreimer bialgebra H of rooted trees (a Hopf algebra after base change to ℤ and collapsing H 0). The monoidal structure is itself given by a polynomial functor, represented by three easily described set maps; we show that these maps are the same as...
The epis of the category of ordered algebras and -continuous homomorphisms
Ana Pasztor (1983)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Similarity:
On the structure of path-like trees
F.A. Muntaner-Batle, Miquel Rius-Font (2008)
Discussiones Mathematicae Graph Theory
Similarity:
We study the structure of path-like trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of path-like trees and we call such generalization generalized path-like trees. As in the case of path-like trees, generalized path-like trees, have very nice labeling properties.