A quasi-stability result for dictatorships in S n

Research output: Contribution to journalArticlepeer-review

Abstract

We prove that Boolean functions on Sn whose Fourier transform is highly concentrated on the first two irreducible representations of Sn, are close to being unions of cosets of point-stabilizers. We use this to give a natural proof of a stability result on intersecting families of permutations, originally conjectured by Cameron and Ku [6], and first proved in [10]. We also use it to prove a ‘quasi-stability’ result for an edge-isoperimetric inequality in the transposition graph on Sn, namely that subsets of Sn with small edge-boundary in the transposition graph are close to being unions of cosets of point-stabilizers.

Original languageEnglish
Pages (from-to)573-618
Number of pages46
JournalCombinatorica
Volume35
Issue number5
DOIs
StatePublished - 1 Oct 2015

All Science Journal Classification (ASJC) codes

  • Computational Mathematics
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'A quasi-stability result for dictatorships in S n'. Together they form a unique fingerprint.

Cite this