The polynomial degree of the Grassmannian G1,n,2

被引：0
|
作者：
Shaw, R [1 ]
Gordon, NA
机构：
[1] Univ Hull, Dept Math, Kingston Upon Hull HU6 7RX, N Humberside, England
[2] Univ Hull, Dept Comp Sci, Kingston Upon Hull HU6 7RX, N Humberside, England
来源：
DESIGNS CODES AND CRYPTOGRAPHY | 2006年 / 39卷 / 02期
关键词：
polynomial degree; subsets of PG(N; 2); Grassmannian G(1; n;
D O I：
10.1007/s10623-005-4524-4
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
For a subset psi of PG(N, 2) a known result states that psi has polynomial degree <= r, r <= N, if and only if psi 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 psi is the Grassmannian G (l, n, 2) subset of PG (N, 2), N = ((n+ 1)(2)) -1, to show that for n < 8 the polynomial degree of G (l, n, 2) is ((n)(2))- 1.
引用
收藏
页码：289 / 306
页数：18
相关论文
共 50 条
12345