Name
Abstract | ||
|---|---|---|
In a fundamental paper R.E. Jamison showed, among other things, that any subset of the points of AG(n, q) that intersects all hyperplanes contains at least n(q - 1) + 1 points. Here we show that the method of proof used by Jamison can be applied to several other basic problems in finite geometries of a varied nature. These problems include the celebrated flock theorem and also the characterization of the elements of GF(q) as a set of squares in GF(q2) with certain properties. This last result, due to A. Blokhuis, settled a well-known conjecture due to J.H. van Lint and the late J. MacWilliams. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/BF00123760 | Des. Codes Cryptography |
Keywords | Field | DocType |
Data Structure,Information Theory,Varied Nature,Basic Problem,Discrete Geometry | Information theory,Discrete geometry,Discrete mathematics,Data structure,Combinatorics,Hyperplane,Conjecture,Mathematics | Journal |
Volume | Issue | Citations |
1 | 3 | 0 |
PageRank | References | Authors |
0.34 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. A. Bruen | 1 | 38 | 7.27 |
| J. C. Fisher | 2 | 0 | 0.34 |