Fourier analysis on finite groups and the Lov\'asz theta-number of Cayley graphs

Abstract

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 Erdos-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 Erdos-Ko-Rado assertion by computer.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…