  We apply Fourier analysis on finite groups to obtain simplified formulations
for the Lov\'asz theta-number of a Cayley graph. We put these formulations to
use by checking a few cases of a conjecture of Ellis, Friedgut, and Pilpel made
in a recent article proving a version of the Erd\H{o}s-Ko-Rado theorem for
$k$-intersecting families of permutations. We also introduce a $q$-analog of
the notion of $k$-intersecting families of permutations, and we verify a few
cases of the corresponding Erd\H{o}s-Ko-Rado assertion by computer.
