Descent classes of permutations with a given number of fixed points

Jacques Désarménien, Michelle L Galloway

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

A desarrangement is a permutation whose first ascent is even. The first author introduced this class of permutations for the purpose of combinatorially explaining a standard recurrence relation for the number of derangements of n elements. He gave a nice bijection between derangements and desarrangements. Here we extend his bijection to obtain more refined enumeration results relating derangements and desarrangements. In particular, we construct a bijection between descent classes of derangements and descent classes of desarrangements. The following monotonicity result is a consequence of this correspondence: In any (nontrivial) descent class the number of permutations with exactly k fixed points decreases as k increases.

Original languageEnglish (US)
Pages (from-to)311-328
Number of pages18
JournalJournal of Combinatorial Theory, Series A
Volume64
Issue number2
DOIs
StatePublished - 1993

Fingerprint

Descent
Rearrangement
Permutation
Bijection
Fixed point
Ascent
Recurrence relation
Enumeration
Monotonicity
Correspondence
Decrease
Class

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Descent classes of permutations with a given number of fixed points. / Désarménien, Jacques; Galloway, Michelle L.

In: Journal of Combinatorial Theory, Series A, Vol. 64, No. 2, 1993, p. 311-328.

Research output: Contribution to journalArticle

@article{89caafae3e3c4798a2f7e8d2763e3510,
title = "Descent classes of permutations with a given number of fixed points",
abstract = "A desarrangement is a permutation whose first ascent is even. The first author introduced this class of permutations for the purpose of combinatorially explaining a standard recurrence relation for the number of derangements of n elements. He gave a nice bijection between derangements and desarrangements. Here we extend his bijection to obtain more refined enumeration results relating derangements and desarrangements. In particular, we construct a bijection between descent classes of derangements and descent classes of desarrangements. The following monotonicity result is a consequence of this correspondence: In any (nontrivial) descent class the number of permutations with exactly k fixed points decreases as k increases.",
author = "Jacques D{\'e}sarm{\'e}nien and Galloway, {Michelle L}",
year = "1993",
doi = "10.1016/0097-3165(93)90100-M",
language = "English (US)",
volume = "64",
pages = "311--328",
journal = "Journal of Combinatorial Theory - Series A",
issn = "0097-3165",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Descent classes of permutations with a given number of fixed points

AU - Désarménien, Jacques

AU - Galloway, Michelle L

PY - 1993

Y1 - 1993

N2 - A desarrangement is a permutation whose first ascent is even. The first author introduced this class of permutations for the purpose of combinatorially explaining a standard recurrence relation for the number of derangements of n elements. He gave a nice bijection between derangements and desarrangements. Here we extend his bijection to obtain more refined enumeration results relating derangements and desarrangements. In particular, we construct a bijection between descent classes of derangements and descent classes of desarrangements. The following monotonicity result is a consequence of this correspondence: In any (nontrivial) descent class the number of permutations with exactly k fixed points decreases as k increases.

AB - A desarrangement is a permutation whose first ascent is even. The first author introduced this class of permutations for the purpose of combinatorially explaining a standard recurrence relation for the number of derangements of n elements. He gave a nice bijection between derangements and desarrangements. Here we extend his bijection to obtain more refined enumeration results relating derangements and desarrangements. In particular, we construct a bijection between descent classes of derangements and descent classes of desarrangements. The following monotonicity result is a consequence of this correspondence: In any (nontrivial) descent class the number of permutations with exactly k fixed points decreases as k increases.

UR - http://www.scopus.com/inward/record.url?scp=38249001068&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38249001068&partnerID=8YFLogxK

U2 - 10.1016/0097-3165(93)90100-M

DO - 10.1016/0097-3165(93)90100-M

M3 - Article

AN - SCOPUS:38249001068

VL - 64

SP - 311

EP - 328

JO - Journal of Combinatorial Theory - Series A

JF - Journal of Combinatorial Theory - Series A

SN - 0097-3165

IS - 2

ER -