The simple-and-double-rainbow conjecture for C_p^nq^m
Statement
Let and be distinct primes and let . Write for the complexity of . 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 is realized by a simple rainbow, unless is even and ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.