An FKN Theorem for the Binary Grassmann Scheme
Yuval Filmus, Anqi Li, Dor Minzer
Abstract
A classical theorem due to Friedgut, Kalai and Naor asserts that if a function f \0,1\n\-1,1\ close to a degree 1 function, then either f or -f is close to either the all 1 function, or to (-1)xi for some i∈ [n]. We prove a version of their theorem for the Grassmann scheme over F2. More precisely, we prove if a function f []0ptF2n\0,1\ is close to a degree 1 function, then either f or 1-f must be close to a function of the form g(L) = Σx∈X1x∈ L+ΣW∈W1L⊂eq W, where X⊂eqF2n is a set of points and W is a set of hyperplanes in F2n.
Create a lesson
Related papers
A Structural Proof of the Lower Bound 21 for 3×3 Matrix Multiplication over F2
Shuxing Yang, Rui Zhao, Junyao Wu et al.
An Operator Approach to Register Programs for Catalytic Computing
Antoine Vinciguerra
Rational Reductions and Regular Languages of Constant Circuit Complexity
Stefan Göller, Amaldev Manuel
Hidden Circuits and Exact Counting in Ordered Graphs
Chenghua Liu, Boning Meng
Improved lower bounds for decomposable randomized encoding
Justin Holmgren, Kewen Wu
Separating Non-redundancy and Chain Length
Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman