Seating Arrangement – A Comprehensive Study Guide
(For CCNA Reasoning Ability – Advanced, MIT‑level)
Why this topic matters
Seating‑arrangement problems test logical deduction, combinatorial reasoning, and the ability to model constraints mathematically. Mastery of these concepts equips you to tackle exam questions, interview puzzles, and real‑world scheduling challenges.
1. Foundations
| Concept | Symbol | Example |
|---|---|---|
| Permutation | (P(n,k)=n!) (if (k=n)) | Arrange 5 people in 5 seats: (5! = 120) |
| Combination | (\binom{n}{k}) | Choose 3 people to sit side‑by‑side from 5 |
| Adjacency | “A sits next to B” | Must be satisfied or avoided |
| Forbidden position | “C cannot sit in seat 2” | Classic derangement condition |
| Circular permutation | ((n-1)!) | Rotating a row doesn't change relative order |
2. Linear Arrangements
2.1 Unconstrained Case
For (n) distinct people and (n) distinct seats in a row:
[
\text{Total ways} = n!
]
2.2 With Fixed Positions
If a subset (S) of people must occupy fixed seats (e.g., seat 1 for Alice), we freeze those positions and permute the remaining (n-|S|) people:
[
\frac{n!}{\prod_{s\in S} 1!} = (n-|S|)!
]
2.3 Adjacent Constraints
Problem: Alice must sit next to Bob.
- Treat Alice and Bob as a single “block.”
- Arrange the block and (n-2) others: ((n-1)!).
- Inside the block, Alice/Bob can be swapped: (2!).
[ \text{Ways} = 2!,(n-1)! ]
Extension: Alice must be adjacent to Bob and Carol, but Carol cannot be between them.
- Form two blocks: ([AB]) and ([BC]) where B is common.
- Count permutations of the 3‑person block + remaining (n-3) people: ((n-2)!).
- Multiply by internal arrangements respecting the “no‑between” rule: (2) (AB vs BA).
3. Circular Arrangements
Circular seating equivalence: rotating all occupants yields the same configuration, but reflections are distinct unless specified.
- Basic count: ((n-1)!)
- With a fixed person (e.g., Alice at seat 1): ( (n-1)! ) (same as linear).
- With adjacency: Treat the adjacent pair as a block, then circularly permute:
[ 2!,(n-2)! ] - With forbidden positions: Use inclusion–exclusion on the circle.
4. Inclusion–Exclusion (IE) for Forbidden Seats
Setup: (n) people, each has a list of forbidden seats.
Define (A_i) = “person (i) sits in a forbidden seat.”
We want (|\overline{A_1}\cap\cdots\cap\overline{A_n}|).
[ |S| = n! ;-; \sum |A_i| ;+; \sum |A_i\cap A_j| ;-; \cdots ]
Example – Derangement: No one sits in their own seat.
- (A_i): “person (i) in seat (i)”.
- (|A_i| = (n-1)!)
- (|A_i\cap A_j| = (n-2)!)
- General term: (\binom{n}{k}(n-k)!)
Thus: [ !n = n! \sum_{k=0}^{n} \frac{(-1)^k}{k!} ] where (!n) is the derangement number (subfactorial).
5. Advanced Topics
5.1 Rook Polynomials
Model forbidden seats as a board (B).
- A rook is placed on a seat; no two rooks share a row or column.
- The coefficient (r_k) of (x^k) in the rook polynomial (R_B(x)) counts placements of (k) non‑attacking rooks.
Inclusion–exclusion via rook polynomials: [ #\text{valid arrangements} = \sum_{k=0}^n (-1)^k r_k (n-k)! ]
Why useful? It handles arbitrary forbidden patterns (e.g., “person i cannot sit in seats i, i+1”) efficiently.
5.2 Group Actions & Burnside’s Lemma
When seats are indistinguishable under a symmetry group (G) (rotations, reflections), the number of distinct arrangements is: [ \frac{1}{|G|}\sum_{g\in G} \text{Fix}(g) ] where (\text{Fix}(g)) is the number of arrangements unchanged by (g).
Example: 4 people around a square table with reflection symmetry.
Compute fixed arrangements for identity, rotations, and reflections.