Counting 1324-avoiding permutations

Darko Marinov, Radoš Radoičić

Research output: Contribution to journalArticle

Abstract

We consider permutations that avoid the pattern 1324. By studying the generating tree for such permutations, we obtain a recurrence formula for their number. A computer program provides data for the number of 1324-avoiding permutations of length up to 20.

Original languageEnglish (US)
JournalElectronic Journal of Combinatorics
Volume9
Issue number2 R
StatePublished - May 29 2003
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Counting 1324-avoiding permutations'. Together they form a unique fingerprint.

  • Cite this