The polynomial degree of the Grassmannian G1,n,2
(2006)
Journal Article
Shaw, R., & Gordon, N. A. (2006). The polynomial degree of the Grassmannian G1,n,2. Designs, codes, and cryptography, 39(2), 289-306. https://doi.org/10.1007/s10623-005-4524-4
For a subset ψ of PG(N, 2) a known result states that ψ has polynomial degree ≤ r, r ≤ N, if and only if ψ intersects every r-flat of PG(N, 2) in an odd number of points. Certain refinements of this result are considered, and are then applied in the... Read More about The polynomial degree of the Grassmannian G1,n,2.