Let be a positive integer, and let be uniform on the sign cube . A Boolean function on this cube is a map . Its real Fourier coefficient at is . Its Fourier degree is , with degree zero for constants. The signed singleton sum is . The square-root question asks whether this sum is bounded by a fixed constant multiple of on every finite sign cube.
The preprint recalls the dimension bound . It also recalls the universal linear bound .
The preprint proves that for every real there are a positive integer and a nonconstant Boolean function such that . The ratios are unbounded over nonconstant Boolean functions on finite sign cubes.
The Lean library BooleanFunctions is the reference for these pages because Lean has checked every result of the Lean library. Each result is stated as the Lean library states it, with a link to the Lean declaration behind it. Where the preprint states a result differently, its statement appears beside the Lean library’s statement. The preprint is a guide only for the order and names of the results.
BooleanFunctions is a Lean library: 13 items, in four groups. Each has a page written by OctoInform, listed below.
No item matches.