ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let TT be a tree, and let JTJ_T be its binomial edge ideal in S=K[x1,…,xn,y1,…,yn]S=K[x_1,\ldots,x_n,y_1,\ldots,y_n]. Denote by #{internal vertices of T}\#\{\text{internal vertices of }T\} the number of internal vertices of TT, and let Jewel be the tree depicted in the source paper. Jewel characterization conjecture. The tree TT contains Jewel as a subgraph if and only if

reg⁡(S/JT)≥#{internal vertices of T}+2.\operatorname{reg}(S/J_T)\geq \#\{\text{internal vertices of }T\}+2.

The forward implication follows from the observation that a tree containing Jewel has regularity at least the number of internal vertices plus two; the converse was suggested by examples computed using SAGE and Macaulay 2 and remains conjectural.

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.