论文标题
一种贪婪的算法，以计算投影平面的线条布置
A greedy algorithm to compute arrangements of lines in the projective plane
论文作者
论文摘要
我们引入了一种贪婪的算法优化了有关属性的线路的布置。我们将此算法应用于简单性的情况：它在很短的时间内恢复了所有已知的线条排列，并且还产生了35行的未知简单布置。我们计算了一个（当然不完整的）数据库的组合简单复杂布置的增压平面，最多50行。令人惊讶的是，它包含了几个示例，这些例子的矩形具有无限的实现空间。
We introduce a greedy algorithm optimizing arrangements of lines with respect to a property. We apply this algorithm to the case of simpliciality: it recovers all known simplicial arrangements of lines in a very short time and also produces a yet unknown simplicial arrangement with 35 lines. We compute a (certainly incomplete) database of combinatorially simplicial complex arrangements of hyperplanes with up to 50 lines. Surprisingly, it contains several examples whose matroids have an infinite space of realizations up to projectivities.
