ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a primitive kk-out graph, meaning a finite directed graph in which every vertex has out-degree kk and whose associated transition structure is primitive. Let C(G)\mathcal C(G) be the set of colorings of GG, and define

#NSC(G):=∣{χ∈C(G):χ(G) is non-synchronizing}∣.\#\mathrm{NSC}(G):=\bigl|\{\chi\in\mathcal C(G):\chi(G)\text{ is non-synchronizing}\}\bigr|.

Fixed-degree counting conjecture. The counting problem

G⟼#NSC(G)G\longmapsto\#\mathrm{NSC}(G)

is #P\#P-complete on the class of primitive kk-out graphs, and remains #P\#P-complete for fixed out-degree kk, already for k=2k=2.

This is presented after a proof of the corresponding decision problem and concerns the exact number of non-synchronizing colorings. The source provides no resolution status for this counting claim.

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.