Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs

Let?1(n) denote the maximum possible absolute value of an entry of the inverse of annbyninvertible matrix with 0,1 entries. It is proved that?1(n)=n(1/2+o(1))n. This solves a problem of Graham and Sloane. Letm(n) denote the maximum possible numbermsuch that given a set ofmcoins out of a collection of coins of two unknown distinct weights, one can decide if all the coins have the same weight or not usingnweighings in a regular balance beam. It is shown thatm(n)=n(1/2+o(1))n. This settles a problem of Kozlov and V?. LetD(n) denote the maximum possible degree of a regular multi-hypergraph onnvertices that contains no proper regular nonempty subhypergraph. It is shown thatD(n)=n(1/2+o(1))n. This improves estimates of Shapley, van Lint and Pollak. All these results and several related ones are proved by a similar technique whose main ingredient is an extension of a construction of Hastad of threshold gates that require large weights.

[1]  Johan Håstad,et al.  On the Size of Weights for Threshold Gates , 1994, SIAM J. Discret. Math..

[2]  Dmitry N. Kozlov,et al.  Coins and Cones , 1997, J. Comb. Theory, Ser. A.

[3]  R. J. Bell,et al.  An Elementary Treatise on Coordinate Geometry of Three Dimensions , 2009, Nature.

[4]  J. H. Wilkinson.  Note on matrices with a very ill-conditioned eigenproblem , 1972 .

[5]  R. Palmer,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[6]  Noga Alon,et al.  The geometry of coin-weighing problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[7]  Ronald L. Graham,et al.  Anti-Hadamard matrices , 1984 .

[8]  Noga Alon,et al.  Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory , 1986, J. Comb. Theory, Ser. A.

[9]  Anders Krogh,et al.  Introduction to the theory of neural computation , 1994, The advanced book program.

[10]  N. ALON,et al.  The smallestn-uniform hypergraph with positive discrepancy , 1987, Comb..

[11]  Frank K. Hwang,et al.  A New Competitive Algorithm for the Counterfeit Coin Problem , 1994, Inf. Process. Lett..

[12]  J. Cohn,et al.  On the value of determinants , 1963 .

[13]  Harlan D. Mills,et al.  Coin Weighing Problems, On , 1964 .

[14]  Saburo Muroga,et al.  Threshold logic and its applications , 1971 .

[15]  Noga Alon,et al.  Coins with Arbitrary Weights , 1997, J. Algorithms.