Weights of Exact Threshold Functions

We consider Boolean exact threshold functions defined by linear equations, and in general degree d polynomials. We give upper and lower bounds on the maximum magnitude (absolute value) of the coefficients required to represent such functions. These bounds are very close. In the linear case in particular they are almost matching. This quantity is the same as the maximum magnitude of integer coefficients of linear equations required to express every possible intersection of a hyperplane in Rn and the Boolean cube {0, 1}n , or in the general case intersections of hypersurfaces of degree d in Rn and the Boolean cube {0, 1}n . In the process we construct new families of ill-conditioned matrices. We further stratify the problem (in the linear case) in terms of the dimension k of the affine subspace spanned by the solutions, and give upper and lower bounds in this case as well. Our bounds here in terms of k leave a substantial gap, a challenge for future work.

• Type: Journal
• Year: 2010
• Where: MFCS
• Authors: László Babai, Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, Xiaoming Sun
• Keywords: Linear, Lower Bounds, Maximum Magnitude, MFCS 2010, Theoretical Computer Science