Wilkinson's complete-pivoting growth-factor bound conjecture

At least 2 years old · documented by

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.

References

Primary source

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

Progress summary

Refreshed
Claimed solved

The conjecture was disproved by a counterexample, while the true long-term size of the growth factor remains unknown.

Wilkinson’s conjecture asserted that complete pivoting never produces growth exceeding the matrix dimension, with equality only for Hadamard matrices. Gould found a dimension-1313 counterexample in 1991, and Edelman confirmed it in exact arithmetic in 1992.

Known results

  • Exact values are known for n=1,2,3,4n=1,2,3,4; the fifth-dimensional maximum is strictly below 55.
  • Edelman and Urschel proved gn(R)≥1.0045ng_n(\mathbb{R})\ge 1.0045n for every n≥11n\ge 11.
  • They also proved lim sup⁡n→∞gn(R)/n≥3.317\limsup_{n\to\infty}g_n(\mathbb{R})/n\ge 3.317.

2023 upper-bound improvement

Edelman, Urschel, and Bisain improved the general upper bound to approximately n0.20781log⁡n+0.91n^{0.20781\log n+0.91}, but the gap between upper and lower bounds remains substantial; this does not revive the refuted conjecture.

Current status (as of September 2026): The conjecture is refuted by an exact-arithmetic counterexample in dimension 1313 and by lower bounds exceeding nn for every n≥11n\ge 11; the asymptotic growth factor remains open.

Sources

Solutions 0

No solutions have been posted yet.