𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Descent classes of permutations with a given number of fixed points

✍ Scribed by Jacques Désarménien; Michelle L Wachs

Book ID
107885208
Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
781 KB
Volume
64
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Number of Permutations Avoiding a
On the Number of Permutations Avoiding a Given Pattern
✍ Noga Alon; Ehud Friedgut 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Let \_ # S k and { # S n be permutations. We say { contains \_ if there exist Stanley and Wilf conjectured that for any \_ # S k there exists a constant c=c(\_) such that F(n, \_) c n for all n. Here we prove the following weaker statement: For every fixed \_ # S k , F(n, \_) c n#\* (n) , where c=c

Number of fixed points of holomorphisms
Number of fixed points of holomorphisms
✍ T. Ya. Azizov; V. A. Khatskevich; D. M. Shoikhet 📂 Article 📅 1991 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 290 KB
A CAT algorithm for generating permutati
A CAT algorithm for generating permutations with a fixed number of inversions
✍ Scott Effler; Frank Ruskey 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 103 KB

We develop a constant amortized time (CAT) algorithm for generating permutations with a given number of inversions. We also develop an algorithm for the generation of permutations with given index.

The number of labeled graphs placeable b
The number of labeled graphs placeable by a given permutation
✍ Hasunuma, Toru; Shibata, Yukio 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 370 KB 👁 2 views

Let S be a finite set and u a permutation on S. The permutation u\* on the set of 2-subsets of S is naturally induced by u. Suppose G is a graph and V(G), €(G) are the vertex set, the edge set, respectively. Let V(G) = S. If €(G) and u\*(€(G)), the image of €(G) by u\*, have no common element, then