Scribd
Upload
3 views

MFCA Principle of Inclusion-exclusion Unit 6

The document discusses the Principle of Inclusion-Exclusion, providing formulas for calculating the union of subsets and generalizations for multiple subsets. It also covers derangements, rook polynomials, and arrangements with forbidden positions, including relevant problems and examples. Key concepts include calculating derangements and rook polynomials for chess boards, as well as addressing arrangements with constraints.

Uploaded by

JINESH VARIA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

MFCA Principle of Inclusion-exclusion Unit 6

The document discusses the Principle of Inclusion-Exclusion, providing formulas for calculating the union of subsets and generalizations for multiple subsets. It also covers derangements, rook polynomials, and arrangements with forbidden positions, including relevant problems and examples. Key concepts include calculating derangements and rook polynomials for chess boards, as well as addressing arrangements with constraints.

Uploaded by

JINESH VARIA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

Principle of Inclusion-Exclusion

Unit – VI
Prof. Sridhar K.R
1.The Principle of Inclusion and Exclusion

2. Generalizations of the Principle


3. Derangement: Nothing is in its Right Place
4. Rook Polynomials and
5. Arrangements with Forbidden Positions
The principle of Inclusion-Exclusion:
1. If 𝐴 and 𝐵 are any two subsets of 𝑆, then 𝐴 ∪ 𝐵 = 𝐴 + 𝐵 − 𝐴 ∩ 𝐵
2. If 𝐴, 𝐵 and 𝐶 are any three subsets of 𝑆, then
𝐴∪𝐵∪𝐶 = 𝐴 + 𝐵 + 𝐶 − 𝐴∩𝐵 − 𝐴∩𝐶 − 𝐵∩𝐶 + 𝐴∩𝐵∩𝐶
Generalized Principle of Inclusion-Exclusion
If 𝐴1 , 𝐴2, 𝐴3 … 𝐴𝑛 are subsets of 𝑆, then
𝐴1 ∪ 𝐴2 ∪ 𝐴3 ∪ ⋯ ∪ 𝐴𝑛

𝑛−1
= ෍ 𝐴𝑖 − ෍ 𝐴𝑖 ∩ 𝐴𝑗 + ෍ 𝐴𝑖 ∩ 𝐴𝑗 ∩ 𝐴𝑘 − ⋯ + −1 𝐴1 ∩ 𝐴2 ∩ 𝐴3 ∩ ⋯ ∩ 𝐴𝑛
Problems
1. Determine the number of positive integers such that 1 ≤ 𝑛 ≤ 100 and 𝑛 is not
divisible by 2, 3 or 5.
2.How many integers between 1 and 300(inclusive) are not divisible by 5, 6 and 8?
3. In how many ways can the 26 letters of the English alphabet be permuted so that none of
the patterns CAR, DOG, PUN or BYTE occurs?
Derangements
A permutation of 𝑛 distinct objects in which none of the objects is in its natural(original) place is called a
derangement.
For example, a permutation of the integers 1,2,3,4…𝑛 in which 1 is not in first place, 2 is not in second
place, 3 is not in the third place, and so on, and 𝑛 is not in the 𝑛𝑡ℎ place is a derangement. Generally,
derangement is denoted by 𝑑𝑛 .
Formula for 𝑑𝑛

1 1 1 −1 𝑛
𝑑𝑛 = 𝑛! 1 − + − + ⋯ +
1! 2! 3! 𝑛!
Note: For 𝑛 ≥ 7 derangement can be calculated using the formula
𝑑𝑛 = 𝑛! × 𝑒 −1
1. Find the number of derangements of 1,2,3, 4. List all derangements.
2. Evaluate 𝑑5 , 𝑑6 , 𝑑7 𝑎𝑛𝑑 𝑑8
Rook Polynomials:
Consider a board that resembles a full chess board or a part of a chess board. Let 𝑛 be the number of
squares present in the board. Pawns are placed in the squares of the board such that not more one pawn
occupies a square. Two pawns are in the same row or in the same row or in the same column of the
board. Let 𝑟𝑘 denote the number of ways in which 𝑘 pawns can be placed on a board such that no two
pawns capture each other – that is, no two pawns are in the same row or in the same column of the
board. Then the polynomial
1 + 𝑛𝑥 + 𝑟2 𝑥 2 + 𝑟3 𝑥 3 + ⋯ + 𝑟𝑛 𝑥 𝑛 is called a rook polynomial for the board considered. If the board
is denoted by 𝐶 then rook polynomial is denoted by 𝑟(𝐶, 𝑥).
𝑟 𝐶, 𝑥 = 1 + 𝑛𝑥 + 𝑟2 𝑥 2 + 𝑟3 𝑥 3 + ⋯ + 𝑟𝑛 𝑥 𝑛
Problems
1. Find the rook polynomial of the following chess board:
2.Find the rook polynomial of the following chess board:
3.Find the rook polynomial of the following chess board:
4.Find the rook polynomial of the following chess board:
Product Formula:
Suppose a board 𝐶 is made up of two parts 𝐶1 and 𝐶2 where 𝐶1 and 𝐶2 have no squares in the same row or
column of 𝐶- such parts of 𝐶 are called disjoint sub-boards of 𝐶. Then the rook polynomial
𝑟 𝐶, 𝑥 = 𝑟 𝐶1 , 𝑥 × 𝑟 𝐶2 , 𝑥
This is known as the product formula for 𝑟 𝐶, 𝑥 .
Arrangements with forbidden positions:
Suppose 𝑚 objects are to be arranged in 𝑛 places, where 𝑛 ≥ 𝑚. Suppose there are constraints under some
objects cannot occupy certain places – such places are called forbidden positions for the said objects. The
number of ways of carrying out this task is given by the following rule:
ഥ = 𝑆0 − 𝑆1 + 𝑆2 − 𝑆3 + ⋯ + −1 𝑛 𝑆𝑛
𝑁
where 𝑆0 = 𝑛! and 𝑆𝑘 = 𝑛 − 𝑘 ! 𝑟𝑘 for 𝑘 = 1,2,3 … , 𝑛.
Here 𝑟𝑘 is the coefficient of 𝑥 𝑘 in the rook polynomial of the board of 𝑚 rows and 𝑛 columns where squares
represent the forbidden places.

You might also like