ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For q≥1q\geq 1, let ln⁡q:(0,+∞)→R\ln_q:(0,+\infty)\to\mathbb{R} be the qq-logarithm

ln⁡q(t):={tq−1−1q−1,q≠1,ln(t),q=1,\ln_q(t):=\begin{cases}\frac{t^{q-1}-1}{q-1}, & q\neq 1,\\ln(t), & q=1,\end{cases}

and define Φqsym(t)=tln⁡q(t)+(1−t)ln⁡q(1−t)\Phi_q^{\mathrm{sym}}(t)=t\ln_q(t)+(1-t)\ln_q(1-t) and the associated symmetric qq-stability by Stabqsym\mathbf{Stab}_q^{\mathrm{sym}}. A Boolean function fdf_d is a dictator function if fd=1{xk=1}f_d=1\{x_k=1\} or 1{xk=−1}1\{x_k=-1\} for some 1≤k≤n1\leq k\leq n; a Boolean function is balanced when Ef=1/2\mathbb{E}f=1/2. Symmetric qq-Stability Conjecture. For 0≤ρ≤10\leq\rho\leq 1 and q∈[1,9]q\in[1,9], it holds that

Stabqsym(f)≤Stabqsym(fd)\mathbf{Stab}_q^{\mathrm{sym}}(f)\leq\mathbf{Stab}_q^{\mathrm{sym}}(f_d)

for all balanced Boolean functions ff, where fdf_d is a dictator function. This conjecture asserts that dictators maximize symmetric qq-stability among balanced Boolean functions; its status is not resolved in the supplied source context.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.