@article { ,
title = {The polynomial degree of the Grassmannian G1,n,2},
abstract = {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 case when ψ is the Grassmannian G 1,n,2 ⊂ PG(N, 2), N = (n + 1/2\} - 1, to show that for n < 8 the polynomial degree of G 1,n,2 is (n/2) - 1. © 2006 Springer Science+Business Media, Inc.},
doi = {10.1007/s10623-005-4524-4},
eissn = {1573-7586},
issn = {0925-1022},
issue = {2},
journal = {DESIGNS CODES AND CRYPTOGRAPHY},
note = {Batch 003. Output ID 25248.},
pages = {289-306},
publicationstatus = {Published},
publisher = {Springer Verlag},
url = {https://hull-repository.worktribe.com/output/396107},
volume = {39},
keyword = {Applied Mathematics, Computer Science Applications},
year = {2006},
author = {Shaw, R. and Gordon, N. A.}
}