Sciweavers

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

34

COMBINATORICS
1998

favoriteEmaildiscussreport

77views more COMBINATORICS 1998»

Permutations which are the Union of an Increasing and a Decreasing Subsequence

13 years 11 months ago

Permutations which are the Union of an Increasing and a Decreasing Subsequence

Download www.combinatorics.org

It is shown that there are 2n n − n−1 m=0 2n−m−1 2m m permutations which are the union of an increasing sequence and a decreasing sequence. 1991 Mathematics Subject Classiﬁcation 05A15 Submitted: December 1, 1997; Accepted: January 10, 1998

M. D. Atkinson

Real-time Traffic

COMBINATORICS 1998 | Decreasing Sequence | Increasing Sequence | Mathematics Subject Classiﬁcation |

claim paper

Related Content

» Permutations Without Long Decreasing Subsequences and Random Matrices

» Longest Increasing Subsequences in PatternRestricted Permutations

» Longest Alternating Subsequences in PatternRestricted Permutations

» Finding Longest Increasing and Common Subsequences in Streaming Data

» Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs

» Pattern classes of permutations via bijections between linearly ordered sets

» A Card Shuffling Analysis of Deformations of the Plancherel Measure of the Symmetric Group

» Reducing reconfiguration time of reconfigurable computing systems in integrated temporal p...

» FixedParameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing

Post Info
More Details (n/a)

Added	21 Dec 2010
Updated	21 Dec 2010
Type	Journal
Year	1998
Where	COMBINATORICS
Authors	M. D. Atkinson

Comments (0)