Minimization of ±1 matrices under line shifts
From MaRDI portal
Publication:5626678
DOI10.4064/cm-23-1-165-171zbMath0222.05016OpenAlexW1488548720MaRDI QIDQ5626678
Thomas A. Brown, J. H. Spencer
Publication date: 1971
Published in: Colloquium Mathematicum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/cm-23-1-165-171
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Orthogonal arrays, Latin squares, Room squares (05B15)
Related Items
The Hardy-Littlewood Inequalities in Sequence Spaces, A new approach to the covering radius of codes, Quasi-random multilinear polynomials, Large-determinant sign matrices of order \(4k+1\), The solution to Berlekamp's switching game, Some results for almost \(D\)-optimal experimental designs, Upper bounds for the constants of Bennett's inequality and the Gale–Berlekamp switching game, General lower bounds on maximal determinants of binary matrices, Discrete ham sandwich theorems, Deterministic parallel algorithms for bilinear objective functions, Unnamed Item, Checking robust nonsingularity is NP-hard, On the Complexity of Robust PCA and ℓ1-Norm Low-Rank Matrix Approximation, Constants of the Kahane-Salem-Zygmund inequality asymptotically bounded by 1, Balancing matrices with line shifts
