ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n1,n2,n3n_1,n_2,n_3 satisfy n1≥n2≥n3≥3n_1 \ge n_2 \ge n_3 \ge 3, and let random rank-11 tuples of length rr in Rn1×n2×n3\mathbb{R}^{n_1 \times n_2 \times n_3} have their expected condition number considered. Finite-expectation conjecture. There exists an integer

2≤r⋆≤n1n2n3n1+n+2+n3−22 \le r^\star \le \frac{n_1 n_2 n_3}{n_1+n+2+n_3-2}

such that for all 1≤r≤r⋆1\leq r\leq r^\star, the expected condition number is finite. The conjecture concerns the average computational difficulty and numerical sensitivity of CP decompositions; the paper provides empirical and impossibility evidence but does not establish the asserted existence of r⋆r^\star.

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.