Highly Influenced

# Increasing and decreasing subsequences and their variants

@inproceedings{Stanley2006IncreasingAD, title={Increasing and decreasing subsequences and their variants}, author={Richard P. Stanley}, year={2006} }

- Published 2006

We survey the theory of increasing and decreasing subsequences of permutations. Enumeration problems in this area are closely related to the RSK algorithm. The asymptotic behavior of the expected value of the length is(w) of the longest increasing subsequence of a permutation w of 1, 2, . . . , n was obtained by Vershik–Kerov and (almost) by Logan–Shepp. The entire limiting distribution of is(w) was then determined by Baik, Deift, and Johansson. These techniques can be applied to other classes… CONTINUE READING

Highly Cited

This paper has 51 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 51 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**51**citations based on the available data.See our **FAQ** for additional information.

#### References

##### Publications referenced by this paper.

Showing 1-10 of 104 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential