ECO method and hill-free generalized Motzkin paths.
Page 1 Next
Barcucci, Elena, Pergola, Elisa, Pinzani, Renzo, Rinaldi, Simone (2001)
Séminaire Lotharingien de Combinatoire [electronic only]
Ferrari, Luca, Leroux, Pierre (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Jiří Novák (1974)
Matematický časopis
Tauraso, Roberto (2008)
Journal of Integer Sequences [electronic only]
Milan R. Tasković (1990)
Archivum Mathematicum
Lascoux, Alain, Schützenberger, Marcel-Paul (1988)
Séminaire Lotharingien de Combinatoire [electronic only]
Anne Micheli, Dominique Rossin (2006)
RAIRO - Theoretical Informatics and Applications
There exists a bijection between one-stack sortable permutations (permutations which avoid the pattern (231)) 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 (231) pattern-avoiding permutations. Moreover, we obtain the generating function of the edit distance between ordered unlabeled trees and some special ones. For...
Kolpakov, Roman (2007)
Journal of Integer Sequences [electronic only]
Václav Havel (1965)
Archivum Mathematicum
Busche. E. (1900)
Mathematische Annalen
M. Stern (1883)
Journal für die reine und angewandte Mathematik
Heiko Harborth (1973)
Journal für die reine und angewandte Mathematik
Bernd Richter (1972)
Journal für die reine und angewandte Mathematik
Edwin Hewitt, G.D. Halsey (1978)
Jahresbericht der Deutschen Mathematiker-Vereinigung
H. Harborth, Ingrid Mengersen (1984)
Elemente der Mathematik
Franz Hering (1973)
Monatshefte für Mathematik
Robert Karpe (1975)
Archivum Mathematicum
Marc Noy (2004)
Gaceta de la Real Sociedad Matemática Española
Chu, Wenchang (2010)
The Electronic Journal of Combinatorics [electronic only]
Cigler, Johann (1981)
Séminaire Lotharingien de Combinatoire [electronic only]
Page 1 Next