Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

4

COMBINATORICS
2002

favoriteEmaildiscussreport

80views more COMBINATORICS 2002»

321-Polygon-Avoiding Permutations and Chebyshev Polynomials

13 years 4 months ago

321-Polygon-Avoiding Permutations and Chebyshev Polynomials

Download www.combinatorics.org

A 321-k-gon-avoiding permutation avoids 321 and the following four patterns: k(k + 2)(k + 3)

Toufik Mansour, Zvezdelina Stankova

Real-time Traffic

321-4-gon-avoiding Permutations | 321-k-gon-avoiding Permutations | COMBINATORICS 2002 | Poincar´e Polynomials |

claim paper

Related Content

» Restricted colored permutations and Chebyshev polynomials

» Restricted even permutations and Chebyshev polynomials

» Restricted Permutations Continued Fractions and Chebyshev Polynomials

» Permutations Which Avoid 1243 and 2143 Continued Fractions and Chebyshev Polynomials

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2002
Where	COMBINATORICS
Authors	Toufik Mansour, Zvezdelina Stankova

Comments (0)