Superization and -specialization in combinatorial Hopf algebras.

Novelli, Jean-Christophe; Thibon, Jean-Yves

The search session has expired. Please query the service again.

Displaying similar documents to “Superization and $(q, t)$ -specialization in combinatorial Hopf algebras.”

Permutations avoiding two patterns of length three.

Vatter, Vincent R. (2003)

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...

Discovering hook length formulas by an expansion technique.

Han, Guo-Niu (2008)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Free dendriform algebras. I: A parenthesis setting.

Leroux, Philippe (2006)

International Journal of Mathematics and Mathematical Sciences

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.

Combinatorics of the free Baxter algebra.

Aguiar, Marcelo, Moreira, Walter (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Completion of the Wilf-classification of 3-5 pairs using generating trees.

Lipson, Mark (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The product of trees in the Loday-Ronco algebra through Catalan alternative tableaux.

Aval, Jean-Christophe, Viennot, Xavier (2010)

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:

Four classes of pattern-avoiding permutations under one roof: Generating trees with two labels.

Bousquet-Mélou, Mireille (2003)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Plane trivalent trees and their patterns

Charles Delorme (2010)

Open Mathematics

Similarity:

The aim of this paper is to characterize the patterns of successive distances of leaves in plane trivalent trees, and give a very short characterization of their parity pattern. Besides, we count how many trees satisfy some given sequences of patterns.

Probabilistic proofs of hook length formulas involving trees.

Sagan, Bruce E. (2009)

Séminaire Lotharingien de Combinatoire [electronic only]

Similarity:

Displaying similar documents to “Superization and ( q , t ) -specialization in combinatorial Hopf algebras.”

Displaying similar documents to “Superization and $(q, t)$ -specialization in combinatorial Hopf algebras.”