ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥2n\geq 2. Define m1(n),m2(n),m3(n),m4(n)m_1(n),m_2(n),m_3(n),m_4(n) to be the four largest possible numbers of valid color vectors, modulo the action of S3S_3 on the colors, among tree pairs corresponding to maps in W\mathfrak W and having nn internal vertices each, with

m4(n)<m3(n)<m2(n)<m1(n).m_4(n)<m_3(n)<m_2(n)<m_1(n).

Let J(n)J(n) denote the Jacobsthal numbers, and write f(n)+(e,o)f(n)+(e,o) for f(n)+ef(n)+e when nn is even and f(n)+of(n)+o when nn is odd. Color count conjecture. The following hold:

m1(n)=J(n−3)+(1,0),n≥5,m2(n)=J(n−4)+(7,5)=m1(n−1)+(7,4),n≥7,m3(n)=J(n−4)+(1,0)=m1(n−1),n≥7,m4(n)=J(n−4)−(1,2)=m1(n−1)−(1,3),n≥7.\begin{aligned} m_1(n)&=J(n-3)+(1,0),&& n\geq 5,\\ m_2(n)&=J(n-4)+(7,5)=m_1(n-1)+(7,4),&& n\geq 7,\\ m_3(n)&=J(n-4)+(1,0)=m_1(n-1),&& n\geq 7,\\ m_4(n)&=J(n-4)-(1,2)=m_1(n-1)-(1,3),&& n\geq 7. \end{aligned}

These formulas are based on computational observations about the numbers of colorings of maps in W\mathfrak W. The authors state that they are unable to determine the quantities in general and present these formulas as conjectural estimates; the supplied text gives no 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.