ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For ρ\rho and nn, let 4Gρ,n44\mathcal{G}_{\rho,n}4 be the directed graph whose vertices are all Boolean functions of nn variables, with a directed edge from each function ff to its optimal predictor sgn⁡Tρf\operatorname{sgn} T_{\rho}f whenever they differ; if TρfT_{\rho}f is identically zero, set sgn⁡Tρf=f\operatorname{sgn} T_{\rho}f=f. A cycle-free directed graph contains no directed cycles.

Optimal-predictor acyclicity conjecture. The graph Gρ,n\mathcal{G}_{\rho,n} contains no cycles.

If true, this would make the number of ρ\rho-self-predicting functions equal to the number of connected components of Gρ,n\mathcal{G}_{\rho,n}, as described in the source; the supplied text 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.