The polygonal formulas for Delta three and Delta four
Statement
For , let denote the function studied in the paper, with . Delta three and Delta four polygonal conjecture. The graph of is the polygonal path connecting
and the graph of is the polygonal path connecting
The authors report computational evidence that these are upper bounds for the corresponding graphs, but have not verified that the bounds are sharp.
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.