QB6
12 marks
Number Theory
Combinatorial Number Theory and Counting
View
[12 points] For sets $S$ and $T$, a relation from $S$ to $T$ is just a subset $R$ of $S \times T$. If $(x, y)$ is in $R$, we say that $x$ is related to $y$. Answer the following. Part (i) is independent of (ii) and (iii).
(i) A relation $R$ from $S$ to $S$ is called antisymmetric if it satisfies the following condition: if $(a, b)$ is in $R$, then $(b, a)$ must NOT be in $R$. For $S = \{1, 2, \ldots, k\}$, how many antisymmetric relations are there from $S$ to $S$?
(ii) Write a recurrence equation for $f(k, n) =$ the number of non-crossing relations from $\{1, 2, \ldots, k\}$ to $\{1, 2, \ldots, n\}$ that have no isolated elements in either set. Your recurrence should have only a fixed number of terms on the RHS.
(iii) Using your recurrence in (ii) or otherwise, find a formula for $f(3, n)$.
Definition 1: We say that a relation from $S$ to $T$ has no isolated elements if each $s$ in $S$ is related to some $t$ in $T$ and if for each $t$ in $T$, some $s$ in $S$ is related to $t$.
Definition 2: We say that a relation $R$ from $\{1, 2, \ldots, k\}$ to $\{1, 2, \ldots, n\}$ is non-crossing if the following never happens: $(i, x)$ and $(j, y)$ are both in $R$ with $i < j$ but $x > y$.
Visual meaning: one can visualise a relation $R$ very similarly to a function. List 1 to $k$ as dots arranged vertically in increasing order on the left and similarly list 1 to $n$ on the right. For each $(s, t)$ in $R$, draw a straight line segment from $s$ on the left to $t$ on the right. In the situation one wants to avoid for non-crossing relations, the segments connecting $i$ with $x$ and $j$ with $y$ would cross. Having no isolated elements also has an obvious visual meaning.