ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let {fn}n≥1\{f_n\}_{n\ge 1} be a sequence of Boolean functions, with parameters {pn}\{p_n\}, that is nondegenerate with respect to {pn}\{p_n\}. Let CnC_n denote the number of pivotal bits for fnf_n, and suppose

lim⁡n→∞E[Cn]=∞.\lim_{n\to\infty}{\mathbb E}[C_n]=\infty.

A Boolean function fnf_n is transitive if there is a transitive group action on [mn][m_n] that leaves fnf_n invariant. Transitive Boolean functions conjecture. If every fnf_n is transitive, then {fn}n≥1\{f_n\}_{n\ge 1} is not tame with respect to {pn}\{p_n\}.

The conjecture proposes that, among nondegenerate transitive Boolean functions, a diverging expected number of pivotal bits rules out tameness. It addresses whether the converse of the finite-total-influence criterion for tameness holds under transitivity; the supplied source does not state a resolution.

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.