Abstract

We consider Boolean exact threshold functions defined by linear equations and, more generally, polynomials of degree . 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 the integer coefficients of linear equations required to express every possible intersection of a hyperplane in and the Boolean cube or, in the general case, intersections of hypersurfaces of degree in and . 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 of the affine subspace spanned by the solutions and give upper and lower bounds in this case as well. There is a substantial gap between these bounds, a challenge for future work.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.