2003
DOI: 10.1016/s0196-8858(02)00531-6
|View full text |Cite
|
Sign up to set email alerts
|

Exceedingly deranging!

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
8
2

Relationship

1
9

Authors

Journals

citations
Cited by 14 publications
(7 citation statements)
references
References 7 publications
0
7
0
Order By: Relevance
“…Proof. Mantaci and Rakotondrajao (see [6]) have proved the identity d o n,k − d e n,k = (−1) n using recursive argument. Applying this with the Corollary 4.5, we get the desired formula.…”
Section: Excedance Distribution Over Padsmentioning
confidence: 99%
“…Proof. Mantaci and Rakotondrajao (see [6]) have proved the identity d o n,k − d e n,k = (−1) n using recursive argument. Applying this with the Corollary 4.5, we get the desired formula.…”
Section: Excedance Distribution Over Padsmentioning
confidence: 99%
“…A similar result for derangements in S n was given by Chapman [7], i.e., the number of even and odd derangements in S n differs by n − 1. This result has been generalized by introducing the concept of "excedance" in the work of Mantaci and Rakotondrajao [13].…”
Section: Signed Excedances On Type B Derangementsmentioning
confidence: 99%
“…This pattern is not new; for example, you can find the sequences e n and o n in the OEIS [12]. A bijective proof using a conjugation argument can be found in [2], and the recent paper [9] offers two more proofs based on an analysis of Table 3. Number of even and odd derangements for n ≤ 7.…”
Section: The Parity Of Derangements and C-derangementsmentioning
confidence: 99%