On a combinatorial problem in geometry |
| |
| Authors: | HL Abbott D Hanson |
| |
| Institution: | Mathematics Department, University of Alberta, Edmonton, Alberta, Canada;Mathematics Department, University of Saskatchewan, Regina, Sask., Canada |
| |
| Abstract: | Denote by g(n) the cardinality of a minimal subset C of an n × n square array of lattice points which does not contain the vertices of a square with sides parallel to the axes, but which is such that the addition of any new point to C forces the appearance of such a square. It is proved that g(n) < nα for some α < 2. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
