ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Fix a tuple of graphs (G1,…,Gd)(\mathcal{G}_1,\dots,\mathcal{G}_d) on vertex set [r][r], and let W⊂(R2)⊗dW \subset (\mathbb{R}^2)^{\otimes d} be the set described by this tuple. Assume that the tuple is a valid graphical description, so each Gj\mathcal{G}_j is a disjoint union of cjc_j complete bipartite graphs. Graphical-description dimension conjecture. Then

r+∑j=1dcj≤2d−1+d,r+\sum_{j=1}^d c_j\leq 2^{d-1}+d,

with equality only if r=2d−1r=2^{d-1}. This proposed bound would constrain the expected dimensions of all valid graphical-description varieties and would identify the only possible equality value of the number of summands.

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.