On the number of Hadamard matrices via anti-concentration
Many problems in combinatorial linear algebra require upper bounds on the number of solutions to an underdetermined system of linear equations Ax=b , where the coordinates of the vector x are restricted to take values in some small subset (e.g. {±1} ) of the underlying field. The classical ways of...
Main Authors: | Ferber, Asaf, Jain, Vishesh, Zhao, Yufei |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Mathematics |
Format: | Article |
Language: | English |
Published: |
Cambridge University Press (CUP)
2022
|
Online Access: | https://hdl.handle.net/1721.1/145894 |
Similar Items
-
SINGULARITY OF RANDOM SYMMETRIC MATRICES—A COMBINATORIAL APPROACH TO IMPROVED BOUNDS
by: Ferber, Asaf, et al.
Published: (2022) -
1‐Factorizations of pseudorandom graphs
by: Ferber, Asaf, et al.
Published: (2022) -
Quantitative invertibility of random matrices : a combinatorial perspective
by: Jain, Vishesh.
Published: (2020) -
Generalizations and Some Applications of Kronecker and Hadamard Products of Matrices
by: Mah'd Al Zhour, Zeyad Abdel Aziz
Published: (2006) -
Construction and classification of group invariant Butson Hadamard matrices
by: Wong, Dai Quan
Published: (2021)