The sequence-growth conjecture for optimal presentations
Statement
Let or be the operation set , and let be the sequence of optimal-presentation quantities used in the source. Here is fixed, and is a sufficiently large constant.
Sequence-growth conjecture. For all ,
for some fixed . In particular, for all ,
The source presents this as a possible route to improved general upper bounds and a connection with questions in number theory; no resolution is given.
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.