> Details

Marinov, Darko; Radoičić, Radoš

Counting 1324-Avoiding Permutations

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: E-Article
  • Title: Counting 1324-Avoiding Permutations
  • Contributor: Marinov, Darko; Radoičić, Radoš
  • Published: The Electronic Journal of Combinatorics, 2003
  • Published in: The Electronic Journal of Combinatorics, 9 (2003) 2
  • Language: Not determined
  • DOI: 10.37236/1685
  • ISSN: 1077-8926
  • Keywords: Computational Theory and Mathematics ; Geometry and Topology ; Theoretical Computer Science ; Applied Mathematics ; Discrete Mathematics and Combinatorics
  • Origination:
  • Footnote:
  • Description: <jats:p>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.</jats:p>
  • Access State: Open Access