Graphs, Designs, Codes and Groups: Topics in Algebraic Combinatorics

图、设计、代码和群：代数组合主题

• 批准号: RGPIN-2016-05397
• 负责人: Bailey, Robert
• 金额: $ 1.31万
• 依托单位: Memorial University of Newfoundland
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2020
• 资助国家: 加拿大
• 起止时间: 2020-01-01 至 2021-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=709671
• 关键词: Graphs; Designs; Codes; Groups; Topics

The title of this proposal reflects my interests in a broad range of topics in the branch of discrete mathematics known as algebraic combinatorics, primarily in graph theory and combinatorial design theory, but also in connection with finite group theory and coding theory. These topics have widespread appeal. Graph theory has applications as diverse as the modelling of computer networks, or organic chemical compounds such as long-chain polymers. Design theory originated in the design of statistical experiments and the scheduling of tournaments. The study of finite permutation groups is one of the oldest subjects in abstract algebra, being a mathematical abstraction of the notion of symmetry, but one which is very relevant in reducing the difficulty of computational problem solving. Coding theory is the mathematical study of the accurate transmission and storage of data. There is also a significant overlap between each of these areas. This proposal has three components. The first part concerns graphs and groups, studying the metric dimension of graphs (efficiently locating vertices using distances, similar to how a smartphone determines its geographical location) and related parameters for permutation groups. The second part is to build an online database of distance-regular and strongly regular graphs, which should become a valuable resource for the mathematics research community. The third part concerns combinatorial design theory, developing the theory of generalized packing and covering designs, which provide a common framework in which to understand a variety of different families of combinatorial designs simultaneously, as well as having applications to areas such as coding, communications and software testing. All three components of the proposal feature projects well-suited to the training of highly qualified personnel, from undergraduate students up to postdoctoral research fellows.

这个建议的标题反映了我的兴趣在广泛的主题在分支离散数学称为代数组合，主要是在图论和组合设计理论，但也与有限群理论和编码理论。 这些话题具有广泛的吸引力。 图论的应用范围很广，比如计算机网络的建模，或者长链聚合物等有机化合物的建模。 设计理论起源于统计实验的设计和比赛的安排。 有限置换群的研究是抽象代数中最古老的课题之一，是对称性概念的数学抽象，但在降低计算问题解决难度方面非常相关。 编码理论是对数据的精确传输和存储的数学研究。 这些领域之间也有很大的重叠。 这项建议有三个组成部分。 第一部分涉及图和群，研究图的度量维度（使用距离有效地定位顶点，类似于智能手机如何确定其地理位置）和置换群的相关参数。 第二部分是建立一个距离正则图和强正则图的在线数据库，这将成为数学研究界的一个宝贵资源。 第三部分涉及组合设计理论，发展了广义包装和覆盖设计理论，它提供了一个共同的框架，同时理解各种不同的组合设计家族，以及在编码，通信和软件测试等领域的应用。 该提案的所有三个组成部分都具有非常适合培养高素质人才的项目，从本科生到博士后研究员。