ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let QdQ_d be the dd-dimensional Hamming cube, let N=2dN=2^d be its number of vertices, and let Cq(Qd)C_q(Q_d) denote the number of proper qq-colorings of QdQ_d. For fixed qq, define

f(q)=⌈q/2⌉2⌊q/2⌋(2−2⌈q/2⌉)d+⌊q/2⌋2⌈q/2⌉(2−2⌊q/2⌋)d.f(q)=\frac{\lceil q/2\rceil}{2\lfloor q/2\rfloor}\left(2-\frac{2}{\lceil q/2\rceil}\right)^d+\frac{\lfloor q/2\rfloor}{2\lceil q/2\rceil}\left(2-\frac{2}{\lfloor q/2\rfloor}\right)^d.

Engbers–Galvin conjecture. For each fixed qq,

Cq(Qd)=(1+1{q odd})(q⌊q/2⌋)(⌊q/2⌋⌈q/2⌉)N/2exp⁡[(1+o(1))f(q)]C_q(Q_d)=(1+\mathbf{1}_{\{q\text{ odd}\}})\binom{q}{\lfloor q/2\rfloor}(\lfloor q/2\rfloor\lceil q/2\rceil)^{N/2}\exp\bigl[(1+o(1))f(q)\bigr]

as d→∞d\to\infty. The first factors count the choices of a main phase and the pure colorings with that phase, while the exponential accounts for isolated flaws. The conjecture is stated as the general fixed-qq prediction, although the paper notes that for q>4q>4 it can be weaker than the actual asymptotics.

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.