✦ LIBER ✦

The Enumeration of Maximally Clustered Permutations

✍ Scribed by Hugh Denoncourt; Brant C. Jones

Publisher: Springer
Year: 2010
Tongue: English
Weight: 378 KB
Volume: 14
Category: Article
ISSN: 0218-0006
DOI: 10.1007/s00026-010-0052-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumerating Permutation Polynomials I: P

Enumerating Permutation Polynomials I: Permutations with Non-Maximal Degree

✍ Claudia Malvenuto; Francesco Pappalardi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 154 KB

Let C be a conjugation class of permutations of a finite field F q . We consider the function N C ðqÞ defined as the number of permutations in C for which the associated permutation polynomial has degree 5q À 2. In 1969, Wells proved a formula for N ½3 ðqÞ where ½k denotes the conjugation class of k

On the Maximally Clustered Elements of C

On the Maximally Clustered Elements of Coxeter Groups

✍ R. M. Green 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 233 KB

q-Enumeration of Salié Permutations

✍ Helmut Prodinger 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 129 KB

Enumeration of the square permutations i

Enumeration of the square permutations in Sn

✍ Joseph Blum 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 219 KB

Algorithm for the enumeration of permuta

Algorithm for the enumeration of permutations with finite repetition

✍ B. M. Zlotnik 📂 Article 📅 1971 🏛 Springer US 🌐 English ⚖ 172 KB

Enumeration of Bigrassmannian Permutatio

Enumeration of Bigrassmannian Permutations Below a Permutation in Bruhat Order

✍ Masato Kobayashi 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 223 KB