Row-deletion conjecture for normalized Hadamard matrices

From papers

A normalized Hadamard matrix of order nn is a Hadamard matrix whose normalization is as used in the source. For a non-negative integer rr and a matrix AA, let ArA_{-r} be the submatrix obtained by deleting the first rr rows of AA. A subset of a Hamming cube is diametrically-maximal if it is maximal subject to having the prescribed diameter. Row-deletion conjecture. For every non-negative integer rr, there is a number n0n_0 such that whenever HH is a normalized Hadamard matrix of order nn0n\geq n_0, the columns of HrH_{-r} form a diametrically-maximal subset of QnrQ_{n-r}. The source notes that this extends the verified cases obtained by deleting zero or one row, while the general assertion remains open.

Progress summary

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

Sources & referencesView supporting material

Primary source

Joseph Briggs, Ziqin Feng and Chris Wells, “Facets in the Vietoris–Rips complexes of hypercubes”, arXiv:2408.01288 (2024).

Solutions 0

No solutions have been posted yet.