Wilkinson's complete-pivoting growth-factor bound conjecture

Let g[CPn(R)]g\big[\mathbf{CP}_n(\mathbb{R})\big] denote the maximum growth factor for complete pivoting over real n×nn\times n matrices. Wilkinson's conjecture.

g[CPn(R)]n,g\big[\mathbf{CP}_n(\mathbb{R})\big] \le n,

with equality achieved only by Hadamard matrices. This historical conjecture was known to be false by 1991, so it is included as a refuted conjecture rather than an open claim.

Sources & referencesView supporting material

Primary source

Alan Edelman and John Urschel, “Some New Results on the Maximum Growth Factor in Gaussian Elimination”, arXiv:2303.04892 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.