Pattern avoidance in partial permutations (extended abstract)

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10051928" target="_blank" >RIV/00216208:11320/10:10051928 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Pattern avoidance in partial permutations (extended abstract)
Original language description
A partial permutation of length n with k holes is a sequence of symbols in which each of the symbols from the set {1,2,...,n-k} appears exactly once, while the remaining symbols are "holes". We define pattern-avoidance in partial permutations and prove that most of the previous results on Wilf equivalence of permutation patterns can be extended to partial permutations with an arbitrary number of holes. We also show that Baxter permutations of a given length k correspond to a Wilf-type equivalence classwith respect to partial permutations with (k-2) holes. Lastly, we enumerate partial permutations with k holes avoiding a given pattern of length at most four.
Czech name
—
Czech description
—

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010)
ISBN
—
ISSN
1365-8050
e-ISSN
—
Number of pages
12
Pages from-to
—
Publisher name
Neuveden
Place of publication
Neuveden
Event location
San Francisco, USA
Event date
Aug 2, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)