ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected simple graph having at most one cycle CC of length mm. Let t≥2t\geq 2 be a natural number. Write SS for the polynomial ring associated with GG, It(G)I_t(G) for its tt-path ideal, νt(G)\nu_t(G) for the maximum number of pairwise suitable tt-paths in GG, and call GG tt-proximal when it satisfies the corresponding tt-proximity condition. Then

reg⁡(S/It(G))={(t−1)νt(G)+(reg⁡(S/It(C))−(t−1)ν3(C)),if G is t-proximal,(t−1)νt(G),otherwise.\operatorname{reg}(S/I_t(G))=\begin{cases} (t-1)\nu_t(G)+\left(\operatorname{reg}(S/I_t(C))-(t-1)\nu_3(C)\right), & \text{if }G\text{ is }t\text{-proximal},\\ (t-1)\nu_t(G), & \text{otherwise}. \end{cases}

Regularity conjecture for t-path ideals. The displayed formula should hold. In particular,

reg⁡(S/It(G))=(t−1)νt(G)\operatorname{reg}(S/I_t(G))=(t-1)\nu_t(G)

when GG is a tree. This conjecture is presented as a natural generalization of the paper's theorem for 33-path ideals; the supplied text gives no resolution status for the general tt-path statement.

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.