ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp and qq be distinct primes, let n⩾m⩾2n\geqslant m\geqslant2, and let c(Cpnqm)\mathfrak{c}(C_{p^nq^m}) denote the complexity. Let SR⁡(n,m)\operatorname{SR}(n,m) and DR⁡(n,m)\operatorname{DR}(n,m) denote the sizes of the simple and double rainbows, respectively. Explicit complexity conjecture.

c(Cpnqm)={DR⁡(n,m)+2=1+6kn=2 and m=2k or m=2 and n=2k,SR⁡(n,m)=(m+33)−⌊m+22⌋⌈m+22⌉+n−m2(m+22)n,m⩾3 and n+m even,SR⁡(n,m)=(m+33)+n−m−12(m+22)n+m odd.\mathfrak{c}(C_{p^nq^m})=\begin{cases} \operatorname{DR}(n,m)+2=1+6k & n=2\text{ and }m=2k\text{ or }m=2\text{ and }n=2k,\\[3pt] \operatorname{SR}(n,m)=\binom{m+3}{3}-\left\lfloor\frac{m+2}{2}\right\rfloor\left\lceil\frac{m+2}{2}\right\rceil+\frac{n-m}{2}\binom{m+2}{2} & n,m\geqslant3\text{ and }n+m\text{ even},\\[3pt] \operatorname{SR}(n,m)=\binom{m+3}{3}+\frac{n-m-1}{2}\binom{m+2}{2} & n+m\text{ odd}. \end{cases}

This refines the preceding simple-and-double-rainbow conjecture using the paper’s computations of the sizes of the two rainbow constructions.

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.