| dc.contributor.author | Marinov, Darko | |
| dc.contributor.author | Rodoicic, Rados | |
| dc.date.accessioned | 2005-12-22T12:00:00Z | en_US |
| dc.date.available | 2005-12-22T12:00:00Z | en_US |
| dc.date.issued | 2003-10-09 | |
| dc.identifier.other | MIT-CSAIL-TR-2003-021 | |
| dc.identifier.other | MIT-LCS-TR-924 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/30426 | |
| dc.description.abstract | We consider permutations that avoid the pattern 1324. We give exact formulas for thenumber of reducible 1324-avoiding permutations and the number of {1324, 4132, 2413, 3241}-avoiding permutations. By studying the generating tree for all 1324-avoiding permutations,we obtain a recurrence formula for their number. A computer program provides data for thenumber of 1324-avoiding permutations of length up to 20. | |
| dc.format.extent | 12 p. | |
| dc.format.extent | 13383375 bytes | |
| dc.format.extent | 567281 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.relation.ispartofseries | Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory | |
| dc.title | Generating Trees of (Reducible) 1324-avoiding Permutations | |
