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.

在过去几年中，计算机在寻找新的出色组合配置以及其不存在的证据中的作用一直在增加。 现在，它是该领域研究中必不可少的工具。 有很多尝试在全球范围内构建适当的软件，但没有在此提出的一系列特定目标。 感兴趣的四个领域是：平衡设计，Ramsey图，垂直阵列和设置覆盖系统。 这些领域的先前研究反复要求采用类似的算法，这些算法以临时方式实施，具体取决于特定情况。 同一区域内的同一算法甚至存在变化。 该项目的一个主要目标是使用商定的统一数据结构来完善，简化和包装现有算法。 使用这些算法，人们可以更多地关注设定系统的理论属性，而不是对编程。 特别的关注也将集中在寻找一些新的重要配置上。