The maximum-length conjecture for circuit codes with long bit runs
Statement
Let and be integers at least of opposite parity, with if is odd and if is even, and set
Here denotes the maximum length of a circuit code with parameters , and denotes the relevant upper-bound quantity for circuit-code lengths.
Maximum-length conjecture. Under these conditions,
This strengthens the previously recalled conjecture for odd and even , extending the predicted equality to opposite-parity pairs satisfying the stated bounds. The equality is confirmed in several cases, including or with odd , and the result for with even in the cited theorems; the general assertion remains open.
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.