Depth lower bound for powers of the path ideal of a cycle graph
Statement
Let , let be the path ideal of the cycle graph on vertices with paths of length , let be the parameter defined by the paper for and , and let . Depth conjecture.
The preceding theorem establishes the corresponding upper bound for all , so the conjecture would determine the depth as for those powers. It is proposed on the basis of computer experiments in CoCoA; the general lower bound for all powers 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.