TITLE: Bounding the absolute sum of entries of the inverse of a  0-1 matrix
QUESTION [14 upvotes]: I have a non-singular square 0-1 matrix and I want to bound the sum of absolute values of its inverse as a function of n (or the vector 1-norm).
Asymptotic results are also useful.
Does anyone know any result that can help me?
Thank you,
ifog

REPLY [14 votes]: An answer is given in:
N. Alon and V. H. Vu, Anti-Hadamard matrices, coin weighing,
threshold gates and indecomposable hypergraphs, J. Combinatorial
Theory, Ser. A 79 (1997), 133-160.
Indeed C above is essentially sqrt n