✦ LIBER ✦

Enumeration of alternating permutations according to peak sets

✍ Scribed by Volker Strehl

Book ID: 107884862
Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 148 KB
Volume: 24
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(78)90010-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Translation sets of permutations: Enumer

Translation sets of permutations: Enumeration of selfcomplementary step-cycles

✍ S. Mossige 📂 Article 📅 1975 🏛 Springer Vienna 🌐 English ⚖ 201 KB

Refined Stirling Numbers: Enumeration of

Refined Stirling Numbers: Enumeration of Special Sets of Permutations and Set-Partitions

✍ J. Katriel 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 110 KB

The refined Stirling numbers of the first kind specify the number of permutations of n indices possessing m i cycles whose lengths modulo k are congruent to i; i ¼ 0; 1; 2; . . . ; k À 1: The refined Stirling numbers of the second kind are similarly defined in terms of set-partitions and the cardi

Fast Algorithms to Enumerate All Common

Fast Algorithms to Enumerate All Common Intervals of Two Permutations

✍ T. Uno; M. Yagiura 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 232 KB

Correction to Algorithm AS 179: Enumerat

Correction to Algorithm AS 179: Enumeration of All Permutations of Multi-sets with Fixed Repetition Numbers, by Miguel A. García-Pérez

✍ Miguel A. García-Pérez 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 57 KB

Medians of Discrete Sets according to a

Medians of Discrete Sets according to a Linear Distance

✍ A. Daurat; A. Del Lungo; M. Nivat 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 284 KB

Enumeration of (uni- or bicolored) plane

Enumeration of (uni- or bicolored) plane trees according to their degree distribution

✍ Gilbert Labelle; Pierre Leroux 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 1021 KB

The main object of this paper is to give explicit formulas for the number of unlabelled bicolored (unrooted) plane trees with given degree distributions (1'12iz., . ; 1/12'2.1 ,). These trees are closely related to the Shabat polynomials, i.e., ~1~~~s over 8: having at most two critical values (cf.