Name
Title | ||
|---|---|---|
Permutations avoiding an increasing number of length-increasing forbidden subsequences |
Abstract | ||
|---|---|---|
Recently, the new problems coming from Computer Science led to the development of the concept of permutations with forbidden subsequences. They arise in sorting problems [10, 22, 33, 36, 37], in the analysis of regularities in words [4, 23], in particular instances of pattern matching algorithms opti-mization [8]; just to mention some examples. The enumeration of permutations with specific forbidden subsequences has also applications in areas such as Algebraic Geometry and Combinatorics. The avoiding permutations, called vexillary permutations, are relevant to the theory of Schubert polynomials. In Combinatorics, permutations with forbidden subsequences play an important role as they present bi-jections with a great number of non-trivial combinatorial objects [13, 14, 15, 18, 20, 21] and moreover their enumeration gives rise to classical number sequences. |
Year | Venue | Keywords |
|---|---|---|
2000 | Discrete Mathematics & Theoretical Computer Science | catalan numbers,permutations,schroder numbers,forbidden subsequences |
DocType | Volume | Issue |
Journal | 4 | 1 |
Citations | PageRank | References |
9 | 1.39 | 18 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elena Barcucci | 1 | 306 | 59.66 |
| Alberto Del Lungo | 2 | 376 | 44.84 |
| Elisa Pergola | 3 | 149 | 18.60 |
| Renzo Pinzani | 4 | 341 | 67.45 |