ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp and qq be distinct primes and let n⩾m⩾2n\geqslant m\geqslant2. Write c(Cpnqm)\mathfrak{c}(C_{p^nq^m}) for the complexity of CpnqmC_{p^nq^m}. A simple rainbow and a double rainbow are the constructions defined in the paper, and the paper also defines the set obtained from a double rainbow in the cited construction. Simple-and-double-rainbow conjecture. The complexity of CpnqmC_{p^nq^m} is realized by a simple rainbow, unless n+mn+m is even and m=2m=2; in that exceptional case, it is realized by the set obtained from a double rainbow. This conjecture is based on computer calculations and tabulated values, and gives a uniform description of which rainbow construction realizes the complexity.

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.