The polynomial degree of the Grassmannian G1,n,2
Shaw, R.; Gordon, N. A.
Dr Neil Gordon N.A.Gordon@hull.ac.uk
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.
|Journal Article Type||Article|
|Journal||DESIGNS CODES AND CRYPTOGRAPHY|
|Peer Reviewed||Peer Reviewed|
|APA6 Citation||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|
|Keywords||Applied Mathematics; Computer Science Applications|
You might also like
Partial spreads in PG(4,2) and flats in PG(9,2) external to the Grassmannian G1,4,2
The quintic Grassmannian g(1,4,2) in PG(9,2)
Learning technologies for learning in health and well-being
Technologies for analysing and improving healthcare processes
Smart, social, flexible and fun: Escaping the flatlands of virtual learning environments