How can I find |A|,having found |UA_{i}^{c}| ?

  • Context: MHB 
  • Thread starter Thread starter evinda
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around finding the size of the set \( |A| \), where \( A \) consists of permutations in \( S_n \) that do not fix any element. The context includes combinatorial reasoning and the application of principles related to derangements.

Discussion Character

  • Mathematical reasoning, Technical explanation

Main Points Raised

  • One participant defines \( A \) as the set of permutations \( \sigma \) in \( S_n \) such that \( \sigma(i) \neq i \) for all \( i \) from 1 to \( n \).
  • Another participant states that \( |A| \) can be calculated using the formula \( |A| = |S_n| - |A^c| \).
  • A participant questions the expression for \( |A| \) and proposes a rearrangement involving \( n! \) and the term \( R(n) \).
  • Further clarification is provided that the term \( 1/e \) in \( R(n) \) can be eliminated, leading to the expression \( |A| = n! \sum_{k=0}^n \frac{(-1)^k}{k!} \).
  • It is noted that permutations in \( A \) are referred to as derangements.

Areas of Agreement / Disagreement

Participants generally agree on the approach to finding \( |A| \) and the use of derangements, but there are multiple expressions and interpretations of the calculations involved, indicating some level of uncertainty.

Contextual Notes

The discussion includes references to combinatorial identities and the behavior of the function \( R(n) \), but the implications of these terms and their derivations remain unresolved.

evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! :)
I am looking at an exercise,that asks me to find $|A|$,where $A=\{\sigma \in S_{n}:\sigma(i) \neq i \forall i=1,...,n \}$
I found that $|A_{1}|=\{ \sigma \in S_{n}:\sigma(1) \neq 1 \} |=(n-1)!(n-1) $ ,from which we get that : $|A_{i}|=\{ \sigma \in S_{n}:\sigma(i) \neq i \} |=(n-1)!(n-1) $

$A=\bigcap_{i \in[n]} A_{i}$ and $A^{c}=U A_{i}^{c}$

$$|U A_{i}^{c}|=\sum_{k=1}^{n}(-1)^{k-1}\sum_{J \subseteq [n],|J|=k}|\bigcap_{i \in J} A_{i}^{c}|=n!(1-\frac{1}{e})+n!R(n) ,\text{ where } R(n)=\frac{1}{e}-\sum_{k=0}^{n}\frac{(-1)^{k}}{k!}$$

But,how can I find $|A|$ ?
 
Physics news on Phys.org
Obviously, $|A|=|S_n|-|A^c|$.
 
Evgeny.Makarov said:
Obviously, $|A|=|S_n|-|A^c|$.

So,is it $n!-n!(1-\frac{1}{e})-n!R(n) =n!(\frac{1}{e}-R(n)$ ?
 
evinda said:
So,is it $n!-n!(1-\frac{1}{e})-n!R(n) =n!(\frac{1}{e}-R(n))$ ?
Yes. Also, $1/e$ that occurs in $R(n)$ can be eliminated to get
\[
|A|=n!\sum_{k=0}^n\frac{(-1)^k}{k!}
\]
By the way, such permulations are called derangements.
 
Evgeny.Makarov said:
Yes. Also, $1/e$ that occurs in $R(n)$ can be eliminated to get
\[
|A|=n!\sum_{k=0}^n\frac{(-1)^k}{k!}
\]
By the way, such permulations are called derangements.

I understand :) Thank you very much!
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 29 ·
Replies
29
Views
5K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 0 ·
Replies
0
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
Replies
8
Views
3K
  • · Replies 9 ·
Replies
9
Views
3K
Replies
1
Views
2K