ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥2n\geq 2 and define

pdreg⁡(n)={(p,r)∣there is a graph G over n vertices with pd⁡(G)=p and reg⁡(G)=r}.\operatorname{pdreg}(n)=\{(p,r)\mid \text{there is a graph }G\text{ over }n\text{ vertices with }\operatorname{pd}(G)=p\text{ and }\operatorname{reg}(G)=r\}.

Monotonicity conjecture. Let r,n≥2r,n\geq 2 be arbitrary integers. If (p,r)∈pdreg⁡(n)(p,r)\in\operatorname{pdreg}(n), then (p,r−1)∈pdreg⁡(n)(p,r-1)\in\operatorname{pdreg}(n). The preceding results show that the spectrum contains broad ranges of projective dimensions for fixed regularity, and computations suggest that these ranges become smaller as regularity increases. The conjecture asserts the corresponding monotonicity across successive regularity values.

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.