✦ LIBER ✦

Ascending sequences in permutations

✍ Scribed by D.G. Rogers

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 724 KB
Volume: 22
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90044-4

No coin nor oath required. For personal study only.

✦ Synopsis

Rcccived 13 July lW6

The problem of the number p(n, I), (1 s I S n), of permutations on the set (1, . . ., n} with longest ascending subsequence of given length I is considered. By placing further restrictions on the ascending subsequence, combinatorial identities are obtained which allow I he explicit calculation of p(n, I) in some cases.

📜 SIMILAR VOLUMES

Permutations and sequences

✍ L Carlitz 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 865 KB

Skolem sequences and additive permutatio

Skolem sequences and additive permutations

✍ Jaromir Abrham; Anton Kotzig 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 432 KB

A new relation between extended C Wem sequences element) and additive permutations is presented. (i.e., Skolem sequences with one zero Skolem [lOI has considered in connection with a study of some triple systems of Steiner' the following problem: is it possible to distribute the numbers 1, 2 , \* -

Multicolored permutations, sequences, an

Multicolored permutations, sequences, and tableaux

✍ Don Rawlings 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 979 KB

Ascending subsequences of permutations a

Ascending subsequences of permutations and the shapes of tableaux

✍ Herbert S Wilf 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Flowshop sequencing with non-permutation

Flowshop sequencing with non-permutation schedules

✍ M. Tandon; P.T. Cummings; M.D. LeVan 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 680 KB

Langford sequences: Some connections wit

Langford sequences: Some connections with complete and additive permutations

✍ Sadao Saito; Takanori Hayasaka 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 444 KB

We explore the relations between Langford (2, m, 3m)-sequences on the one hand and complete and addtive permutations on the other. We consider in this context permutations with a certain "splitting" property and report on the results of some computer studies.