On the number of rational points on codimension-1 algebraic sets in Pn(Fq)
✍ Scribed by Anders Bjært Sørensen
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 644 KB
- Volume
- 135
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
An upper bound on the number of F,-rational points on a pure (n -l)-dimensional algebraic set of low degree defined over F, in P(F,) is given, using simple counting arguments, and the result is generalized to all degrees using results from coding theory. The bound depends on n, q, d, where d is the degree of the algebraic set. A number of corollaries are deduced and applications to coding theory are mentioned.
📜 SIMILAR VOLUMES
It is shown that for fixed 1 ~ 0, if X C PG (d, q) contains (1 + ~)q~ points, then the number of r-fiats spanned by X is at least C(r.)q (r+l)ts+l-r), i.e. a positive fraction of the number of r-fiats in PG(s + 1,q).
In this paper the number of directions determined by a set of q&n points of AG(2, q) is studied. To such a set we associate a curve of degree n and show that its linear components correspond to points that can be added to the set without changing the set of determined directions. The existence of li