论文标题
您应该在一场偶数游戏中张贴多少张卡片？：对AG中的帽子的详细研究
How many cards should you lay out in a game of EvenQuads?: A detailed study of caps in AG(n,2)
论文作者
论文摘要
我们在仿射几何$ ag（n，2）$中定义A \ textIt {cap}是一个子集，其中任何4个点的集合都处于一般位置。在本文中，我们将$ k \ leq 9 $的$ ag（n，2）$中的所有上限分类为$ ag（n，2）$。结果，我们获得了尺寸$ n \ leq 6 $的CAPS的完整表征，尤其是完整和最大帽。由于\ textIt {evenquads}卡甲板是$ ag（6,2）$的型号，因此，我们确定任意$ k $ card布局包含Quad的概率。
We define a \textit{cap} in the affine geometry $AG(n,2)$ to be a subset in which any collection of 4 points is in general position. In this paper we classify, up to affine equivalence, all caps in $AG(n,2)$ of size $k \leq 9$. As a result, we obtain a complete characterization of caps in dimension $n \leq 6$, in particular complete and maximal caps. Since the \textit{EvenQuads} card deck is a model for $AG(6,2)$, as a consequence we determine the probability that an arbitrary $k$-card layout contains a quad.
