Search arXivSearch

arXiv · 1210.3989

A stability result for balanced dictatorships in $S_{n}$

Abstract

We prove that a balanced Boolean function on $S_{n}$ whose Fourier transform is highly concentrated on the first two irreducible representations of $S_{n}$, is close in structure to a dictatorship, a function which is determined by the image or pre-image of a single element. As a corollary, we obtain a stability result concerning extremal isoperimetric sets in the Cayley graph on $S_{n}$ generated by the transpositions. Our proof works in the case where the expectation of the function is bounded away from $0$ and $1$. In contrast, [Ellis, D., Filmus, Y., Friedgut, E., A quasi-stability result for dictatorships in $S_{n}$, Combinatorica 35 (2015), pp. 573-618] deals with Boolean functions of expectation O(1/n) whose Fourier transform is highly concentrated on the first two irreducible representations of $S_{n}$. These need not be close to dictatorships; rather, they must be close to a union of a constant number of cosets of point-stabilizers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David Ellis, Yuval Filmus, Ehud Friedgut. 2017-06-30. A stability result for balanced dictatorships in $S_{n}$. https://arxiv.org/abs/1210.3989

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO