Permutations which are the union of an increasing and a decreasing subsequence
From MaRDI portal
Publication:1379128
zbMath0885.05011MaRDI QIDQ1379128
Publication date: 18 February 1998
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119235
Related Items (13)
Labelled well-quasi-order for permutation classes ⋮ The enumeration of permutations whose posets have a maximum element ⋮ Longest increasing subsequences and log concavity ⋮ Finite transition matrices for permutations avoiding pairs of length four patterns ⋮ Suballowable sequences and geometric permutations ⋮ Reduced word manipulation: patterns and enumeration ⋮ Permutations of a multiset avoiding permutations of length 3 ⋮ Geometric grid classes of permutations ⋮ Simple permutations and pattern restricted permutations ⋮ Growth rates of permutation grid classes, tours on graphs, and the spectral radius ⋮ Combinatorial generation via permutation languages. I. Fundamentals ⋮ On the centrosymmetric permutations in a class ⋮ Automatic congruences for diagonals of rational functions
This page was built for publication: Permutations which are the union of an increasing and a decreasing subsequence