Diophantine approximation, chromatic number, and equivalence classes of separated nets

丢番图近似、色数和分离网的等价类

• 批准号: EP/L001462/2
• 负责人: Alan Haynes
• 金额: $ 29.07万
• 依托单位: University of York
• 依托单位国家: 英国
• 项目类别: Research Grant
• 财政年份: 2013
• 资助国家: 英国
• 起止时间: 2013 至 无数据
• 项目状态: 已结题
• 来源: https://gtr.ukri.org/projects?ref=EP%2FL001462%2F2
• 关键词: Diophantine; approximation; chromatic; number; equivalence

In the branch of mathematics called combinatorics, a graph is an abstract object which can be thought of as a collection of points (called vertices), some of which are connected by line segments (called edges). We say that two vertices in a graph are adjacent if there in an edge connecting them. A colouring of a graph is a rule that assigns a label (called a colour) to each vertex, and the chromatic number of the graph is the minimum number of colours necessary to colour the graph so that no two adjacent vertices are the same colour.Graph colourings have a multitude of practical applications. As an example, suppose you would like to invite a number of people for interviews on the same day but that there are certain pairs of candidates whom you don't want to interview at the same time. What is the minimum number of time slots that you need? Think of the candidates as the vertices of a graph, with an edge connecting one to another if they are to be put in different time slots. If we let our different colours represent different time slots, then answering our question is equivalent to determining the chromatic number of the graph. This is merely an example to demonstrate the ease with which one can turn a common logistics problem into a problem about graph colourings. There are many problems like this in biology, physics, industry, computer science, and in the social sciences and media (for example social networking). Part of our proposal is to identify these problems and to use our mathematical techniques to solve them.Our approach to studying chromatic number is via an unexpected route. We will be considering the chromatic number of important families of infinite graphs, by connecting them with problems in Diophantine approximation (the study of approximation of numbers by fractions) and dynamical systems. This is a promising new direction which will push the boundary of current knowledge in mathematics and open the door for the flow of new ideas between many subjects.

在数学的分支组合学中，图是一个抽象的对象，它可以被认为是点（称为顶点）的集合，其中一些点由线段（称为边）连接。我们说一个图中的两个顶点是相邻的，如果有一条边连接它们。图的着色是指给图的每一个顶点赋予一个标号（称为颜色）的规则，图的色数是使图的每一个相邻顶点都不具有相同颜色所需的最小颜色数。图的着色有许多实际应用。举个例子，假设你想在同一天邀请多个人参加面试，但是有几对候选人你不想同时面试。您需要的最小时隙数是多少？把候选人看作是一个图的顶点，如果要把他们放在不同的时隙中，就用一条边把他们连接起来。如果我们让不同的颜色代表不同的时隙，那么回答我们的问题就相当于确定图的色数。这仅仅是一个例子，展示了如何轻松地将一个普通的物流问题转化为一个关于图着色的问题。在生物学、物理学、工业、计算机科学、社会科学和媒体（例如社交网络）中存在许多类似的问题。我们的建议的一部分是确定这些问题，并使用我们的数学技术来解决它们。我们的方法来研究色数是通过一个意想不到的路线。我们将考虑重要的无限图族的色数，通过将它们与丢番图逼近（分数逼近数的研究）和动力系统中的问题联系起来。这是一个很有前途的新方向，它将推动当前数学知识的边界，并为许多学科之间的新思想流动打开大门。

项目成果

Gaps problems and frequencies of patches in cut and project sets

剪切和项目集中的间隙问题和补丁频率

• DOI: 10.1017/s0305004116000128
• 发表时间: 2016
• 期刊: Mathematical Proceedings of the Cambridge Philosophical Society
• 影响因子: 0.8
• 作者: HAYNES A

Hankel Determinants of Zeta Values

Zeta 值的 Hankel 决定因素

• DOI: 10.3842/sigma.2015.101
• 发表时间: 2015
• 期刊: Methods and Applications
• 作者: Haynes A

Constructing bounded remainder sets and cut-and-project sets which are bounded distance to lattices

构造有界余数集和剪切投影集，它​​们是到格的有界距离

• DOI: 10.1007/s11856-016-1283-z
• 发表时间: 2016
• 期刊: Israel Journal of Mathematics
• 影响因子: 1
• 作者: Haynes A

Equivalence classes of codimension-one cut-and-project nets

余维一割投影网的等价类

• DOI: 10.1017/etds.2014.90
• 发表时间: 2014
• 期刊: Ergodic Theory and Dynamical Systems
• 影响因子: 0.9
• 作者: HAYNES A

Reductive pairs arising from representations

• DOI: 10.1016/j.jalgebra.2016.02.006
• 发表时间: 2014-12
• 期刊: arXiv: Group Theory
• 作者: Oliver Goodbourn