Enumeration of factorizable multi-dimensional permutations.
Zhang, Hao, Gildea, Daniel (2007)
Journal of Integer Sequences [electronic only]
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 “Completion of the Wilf-classification of 3-5 pairs using generating trees.”
Enumeration of factorizable multi-dimensional permutations.
Permutations avoiding an increasing number of length-increasing forbidden subsequences.
Barcucci, Elena, Del Lungo, Alberto, Pergola, Elisa, Pinzani, Renzo (2000)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
A survey of stack-sorting disciplines.
Bóna, Miklós (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Permutations avoiding two patterns of length three.
Vatter, Vincent R. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alternating, pattern-avoiding permutations.
Lewis, Joel Brewster (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Variations on descents and inversions in permutations.
Chebikin, Denis (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Counting 1324-avoiding permutations.
Marinov, Darko, Radoičić, Radoš (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...
The permutation classes equinumerous to the smooth class.
Bóna, Miklós (1998)
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:
Permutation reconstruction from minors.
Raykova, Mariana (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Longest increasing subsequences in pattern-restricted permutations.
Deutsch, Emeric, Hildebrand, A.J., Wilf, Herbert S. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Permutation reconstruction.
Smith, Rebecca (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: