ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn and rr be non-negative integers, and let E1E_1 and YY denote the edge and monomial-index sets used in the moment matrix extension algorithm. For an integer cc, write

Rc(n)=∑j=0c(n−j+1).R_c(n)=\sum_{j=0}^c(n-j+1).

A format is called very efficient when the corresponding linear system has the required tall-matrix property, and efficient when the algorithm decomposes generic tensors in that format.

Very efficient format conjecture.

  1. The format (n,Rc(n))(n,R_c(n)) is very efficient if cc is such that ∣E1∣≥∣Y∣|E_1|\geq |Y|.
  2. The format (n,r)(n,r) is efficient if there exists cc with r≤Rc(n)r\leq R_c(n) such that (n,Rc(n))(n,R_c(n)) is very efficient.

This conjecture would extend the proved efficient-format range from ranks of order nn to ranks of order n2n^2, making moment matrix extension and tensor decomposition effective for a substantially larger family of tensors. The paper reports a computer-assisted verification of the conjectured behavior up to n=17n=17.

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.