Darko Marinov, Rado Radoicic  Home/Search
Context Related
| combinatorics.org/Volume_9...v9i2r13.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: combinatorics.org/Volume_9/Pos... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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. (Update)
Cited by: More
On the Wilf-Stanley limit of 4231-avoiding.. - Albert, Elder.. (2005) (Correct)
Active bibliography (related documents): More All
2.0: Counting 1324-avoiding Permutations - Marinov, Radoicic (2003) (Correct)
0.5: Open Problems 25 - West (1998) (Correct)
0.5: On Growth Rates of Closed Permutation Classes - Kaiser, Klazar (2003) (Correct)
Similar documents based on text: More All
0.3: Rainbow Arithmetic Progressions and Anti-Ramsey Results - Jungic, Licht, Mahdian.. (2003) (Correct)
0.2: Rainbow Ramsey Theory - Jungic, Nesetril, Radoicic (2004) (Correct)
0.2: Relaxing Planarity for Topological Graphs - Pach, Radoicic, Toth (Correct)
BibTeX entry: (Update)
Darko Marinov and Rados Radoicic. Counting 1324-avoiding permutations. Electron. J. Combin. , 9(2):Research paper 13, 9 pp. (electronic), 2002. http://citeseer.ist.psu.edu/marinov03counting.html More
@misc{ marinov02counting,
author = "D. Marinov and R. Radoicic",
title = "Counting 1324-avoiding permutations",
text = "Darko Marinov and Rados Radoicic. Counting 1324-avoiding permutations.
Electron. J. Combin. , 9(2):Research paper 13, 9 pp. (electronic), 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/marinov03counting.html" }
Citations (may not include all citations):105 The encyclopedia of integer sequences (context) - Sloane, Plou et al. - 1996
84 Princeton University Press (context) - Bellman, programming - 1957
53 Restricted permutations (context) - Simion, Schmidt - 1985 ACM
47 Symmetric functions and P-recursiveness (context) - Gessel - 1990 ACM
36 functions and machine learning (context) - Michie - 1968
35 Generating trees and the Catalan and Schroder numbers (context) - West - 1995
31 Asymptotic values for degrees associated with strips of Youn.. (context) - Regev - 1981
26 Generating trees and forbidden subsequences - West - 1996 ACM
24 The number of Baxter permutations (context) - Chung, Graham et al. - 1978
17 ECO: a methodology for the enumeration of combinatorial obje.. (context) - Barcucci, Lungo et al. - 1999
16 AddisonWesley Publishing Co (context) - Knuth, of et al. - 1973
13 Forbidden subsequences (context) - Stankova - 1994 ACM
8 are Wilf-equivalent (context) - Babson, West et al. - 2000
6 With a foreword by Gian-Carlo Rota and appendix 1 by Sergey .. (context) - Stanley, combinatorics et al. - 1999
6 Exact enumeration of 1342-avoiding permutations: a close lin.. - os, ona - 1997
3 Restricted permutations and queue jumping - Albert, Aldred et al.
3 Classi cation of forbidden subsequences of length (context) - Stankova - 1996
3 Permutations avoiding certain patterns: the case of length 4.. (context) - os, ona - 1997
2 nzstaffprivmikeAvoidApplet StrongClas (context) - class, www et al. - 2003
2 Kleitman and combinatorics: a celebration (context) - Wilf, of et al. - 1999
Documents on the same site (http://www.combinatorics.org/Volume_9/PostScriptfiles/): More
321-polygon-avoiding permutations and Chebyshev polynomials - Mansour, Stankova (2003) (Correct)
Optimal Double-Loop Networks with Non-Unit Steps - Aguilo, Simó.. (2002) (Correct)
Combinatorial Laplacian of the Matching Complex - Dong, Wachs (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC