RUI: Computer Search for Elusive Combinatorial Congfigurations: A Research Toolchest

RUI：难以捉摸的组合配置的计算机搜索：研究工具箱

• 批准号: 8920692
• 负责人: Donald Kreher
• 金额: $ 4.12万
• 依托单位: Rochester Institute of Tech
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1990
• 资助国家: 美国
• 起止时间: 1990-04-15 至 1991-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=8920692&HistoricalAwards=false
• 关键词: RUI; Computer; Search; Elusive; Combinatorial

The role of the computer in the search for new exceptional combinatorial configurations, as well as in the proofs of their nonexistence, has been increasing over the last few years. It is now an indispensable tool in research in this area. There have been many attempts to build appropriate software in this direction worldwide, but none with the range of specific goals proposed here. The four areas of interest are: balance designs, Ramsey graphs, perpendicular arrays and set coverings systems. Previous research in these areas repeatedly called for similar algorithms, which were implemented in an ad hoc manner, depending on the particular situation. There were even variations of the same algorithm within the same area. A principal goal of this one year project is to refine, streamline and package the existing algorithms, using agreed upon uniform data structures. With these algorithms one can devote more attention on the theoretical properties of the set systems rather than on programming. Particular attention will also be focused on finding some new important configuations.

计算机在寻找新的例外中的作用 组合配置，以及在证明他们的 不存在，在过去的几年里一直在增加。 现在 这是该领域研究中不可或缺的工具。 发生多 试图在全世界范围内朝着这个方向构建适当的软件， 但没有一个与这里提出的一系列具体目标相符。 四 感兴趣的领域是：平衡设计，拉姆齐图，垂直 阵列和套装覆盖物系统。 之前的研究 这些领域反复要求类似的算法， 根据具体情况，以临时方式实施 形势 甚至有相同算法的变体， 同一个区域。 这个为期一年的项目的主要目标是 改进、简化和打包现有算法，使用商定的 统一的数据结构。 有了这些算法， 更加重视集合系统的理论性质 而不是编程。 还将特别关注 找到一些新的重要配置