Vincent R. Vatter Department of Mathematics Rutgers University, Piscataway,...  Home/Search
Context
Related
| combinatorics.org/Volume_9/...v9i2r6.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 study permutations that avoid two distinct patterns of length three and any additional set of patterns. We begin by showing how to enumerate these permutations using generating trees, generalizing the work of Mansour. We then find sufficient conditions for when the number of such permutations is given by a polynomial and answer a question of Egge. Afterwards, we show how to use these computations to count permutations that avoid two distinct patterns of length three and contain other... (Update)
Active bibliography (related documents): More All
3.3: Permutations Avoiding Two Patterns of Length Three - Vatter (2003) (Correct)
0.4: On the Wilf-Stanley limit of 4231-avoiding.. - Albert, Elder.. (2005) (Correct)
0.3: 231-Avoiding Involutions and Fibonacci Numbers - Egge, Mansour (2002) (Correct)
Similar documents based on text: More All
0.4: Maximal and Maximum Independent Sets in Graphs With At Most R.. - Sagan, Vatter (Correct)
0.4: Maximal Independent Sets In Graphs With At Most r Cycles - Sagan, Vatter (Correct)
0.2: Pattern Frequency Sequences and Internal Zeros - Bona, Sagan, Vatter (2002) (Correct)
BibTeX entry: (Update)
@misc{ vatter-permutations,
author = "Vincent Vatter",
title = "Permutations Avoiding Two Patterns of Length Three",
url = "citeseer.ist.psu.edu/639694.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1973
101 The Mathematical Theory of L Systems (context) - Rozenberg, Salomaa - 1980
60 Some combinatorial properties of Schubert polynomials - Billey, Jockusch et al. - 1993
53 Restricted permutations (context) - Simion, Schmidt - 1985
47 Symmetric functions and P-recursiveness (context) - Gessel - 1990
35 Generating trees and the Catalan and Schroder numbers (context) - West - 1995
26 Generating trees and forbidden subsequences - West - 1996
26 Combinatory Analysis (context) - MacMahon - 1960
24 The number of Baxter permutations (context) - Chung, Graham et al. - 1978
23 Generating functions for generating trees - Banderier, Bousquet-M et al. - 2002
10 Restricted permutations (context) - Atkinson - 1999
7 Partially well-ordered closed sets of permutations - Atkinson, Murphy et al. - 2002
5 On exponential growth in Lindenmayer systems (context) - Salomaa - 1973
5 The enumeration of permutations with a prescribed number of .. - Noonan, Zeilberger - 1996
4 Restricted permutations related to Fibonacci numbers and k-g.. (context) - Egge
3 Permutations avoiding a pattern from S k and at least two pa.. (context) - Mansour - 2002
3 Finite transition matrices for permutations avoiding pairs o.. (context) - Kremer, Shiu
2 Permutations containing a pattern exactly once and avoiding .. (context) - Mansour
2 Permutations sans sous sequence interdite (context) - Guibert - 1992
2 An algebraic characterization of the set of succession rules (context) - Ferrai, Pergola et al. - 2002
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