首页 | 本学科首页   官方微博 | 高级检索  
     


Caps in PG(n,q),q even,n⩾3
Authors:L. Storme  T. Szönyi
Affiliation:1. Seminar of Geometry and Combinatorics, University of Gent, Krijgslaan 281, B-9000, Gent, Belgium
2. Department of Computer Science, E?tv?s University, Múzeum krt. 6-8, H-1088, Budapest, Hungary
Abstract:Letm2(3,q) be the largest value ofk(k<q 2+1) for which there exists a completek-cap in PG(3,q),q even. In this paper, the known upper bound onm2(3,q) is improved. We also describe a number of intervals, fork, for which there does not exist a completek-cap in PG(3,q),q even. These results are then used to improve the known upper bounds on the number of points of a cap in PG(n, q),q even,n?4.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号