The number of permutations containing exactly one increasing subsequence of length three

Discrete Mathematics

Volumn 152, Issue 1-3, 1996, Pages 307-313

  Noonan, John ^a  

^a Temple University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001363286     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00247-T     Document Type: Article

References (4)

1. K. Erikson and S. Linusson, The size of Fulton's essential set, The Electronic J. Combin. 1, R6 (1995) 18 pp.
2. D. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching (Addison-Wesley, Reading, MA, 1973).
3. R. Simion and F.W. Schmidt, Restricted permutations, Eur. J. Combin. 6 (1985) 383-406.
4. J. West, Permutations with forbidden subsequences and stack sortable permutations, Ph.D. Thesis, MIT, Cambridge, 1990.