Jackson's inequality on the hypercube
Paata Ivanisvili, Roman Vershynin, Xinyuan Xie

TL;DR
This paper explores bounds on Jackson's inequality related to functions on the hypercube, revealing limitations of sensitivity-based bounds, and establishing new results on approximate degree, symmetry, and subspace approximation.
Contribution
It provides new lower bounds for Jackson's inequality on the hypercube, demonstrates the failure of the sensitivity theorem for bounded functions, and introduces bounds for symmetric functions and subspace approximation.
Findings
J(n, 0.499n) is bounded below by a positive constant independent of n
Reverse Bernstein inequality fails in the tail space for certain parameters
Existence of functions with constant sensitivity but linearly growing approximate degree
Abstract
We investigate the best constant such that Jackson's inequality \[ \inf_{\mathrm{deg}(g) \leq d} \|f - g\|_{\infty} \leq J(n,d) \, s(f), \] holds for all functions on the hypercube , where denotes the sensitivity of . We show that the quantity is bounded below by an absolute positive constant, independent of . This complements Wagner's theorem, which establishes that . As a first application we show that reverse Bernstein inequality fails in the tail space improving over previously known counterexamples in . As a second application, we show that there exists a function whose sensitivity remains constant, independent of , while the approximate degree grows linearly with . This result implies that the sensitivity theorem $s(f) \geq…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Limits and Structures in Graph Theory
