Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with extremal-combinatorics
Search options not deleted
user 34180
3
votes
Blocking sets in three dimensional finite affine spaces
Here is an improvement of the upper bound which I found in ``The polynomial method in Galois geometries'' by Simeon Ball. See page number 4.
The known constructions are somewhat crude. For exampl …
- 1,197
11
votes
2
answers
781
views
Blocking sets in three dimensional finite affine spaces
What is the smallest possible size of a set of points in $\mathbb{F}_q^3$ which intersects (blocks) every line?
Clearly the union of three affine hyperplanes that intersect in a singleton, say $x = 0 …
- 1,197