Sciweavers

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

33

COMBINATORICS
2002

favoriteEmaildiscussreport

105views more COMBINATORICS 2002»

Counting 1324-Avoiding Permutations

13 years 10 months ago

Counting 1324-Avoiding Permutations

Download pictor.math.uqam.ca

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.

Darko Marinov, Rados Radoicic

Real-time Traffic

1324-avoiding Permutations | COMBINATORICS 2002 | Permutations | Recurrence Formula |

claim paper

Related Content

» Counting descent pairs with prescribed tops and bottoms

» Counting Distance Permutations

» The number of convex permutominoes

» ThreeLetterPatternAvoiding Permutations and Functional Equations

» Restricted colored permutations and Chebyshev polynomials

» Enumerating permutation polynomials over finite fields by degree II

» Range Minima Queries with Respect to a Random Permutation and Approximate Range Counting

» Counting Patternfree Set Partitions II Noncrossing and Other Hypergraphs

» Impossibility of Succinct Quantum Proofs for CollisionFreeness

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2002
Where	COMBINATORICS
Authors	Darko Marinov, Rados Radoicic

Comments (0)