ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let S=K[x1,…,xn]S=K[x_1,\ldots,x_n], let Jn,mJ_{n,m} be the path ideal of the cycle graph on nn vertices with paths of length mm, let dd be the parameter defined by the paper for nn and mm, and let t≥1t\geq 1. Depth conjecture.

depth⁡(S/Jn,mt)≥d−1.\operatorname{depth}(S/J_{n,m}^t)\geq d-1.

The preceding theorem establishes the corresponding upper bound for all t≥t0t\geq t_0, so the conjecture would determine the depth as d−1d-1 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 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.