课题基金 / 基金详情

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

Diophantine approximation, chromatic number, and equivalence classes of separated nets
丢番图近似、色数和分离网的等价类
批准号:
EP/L001462/2
负责人:
Alan Haynes
金额:
$29.07万
依托单位:
依托单位国家:
英国
项目类别:
Research Grant
财政年份:
2013
资助国家:
英国
项目状态:
已结题
起止时间:
2013 至 --

项目摘要

项目成果

Alan Haynes的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
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.
期刊论文(10)
专著(0)
科研奖励(0)
会议论文
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]
通讯作者: HAYNES A
Hankel Determinants of Zeta Values
Zeta 值的 Hankel 决定因素
DOI: 10.3842/sigma.2015.101
发表时间: 2015
期刊: Methods and Applications
影响因子: --
作者: [Haynes A]
通讯作者: 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]
通讯作者: Haynes A
DOI: 10.1017/etds.2014.90
发表时间: 2014
期刊: Ergodic Theory and Dynamical Systems
影响因子: 0.9
作者: [HAYNES A]
通讯作者: HAYNES A
10
    Diophantine Approximation and Aperiodic Order
    • 批准号:
      2001248
    • 项目类别:
      Standard Grant
    • 资助金额:
      $18.67万
    • 财政年份:
      2020
    • 负责人:
      Alan Haynes
    • 依托单位:
    Houston Summer School on Dynamical Systems
    • 批准号:
      1700273
    • 项目类别:
      Standard Grant
    • 资助金额:
      $4.5万
    • 财政年份:
      2017
    • 负责人:
      Alan Haynes
    • 依托单位:
    Gaps theorems and statistics of patterns in quasicrystals
    • 批准号:
      EP/M023540/1
    • 项目类别:
      Research Grant
    • 资助金额:
      $41.0万
    • 财政年份:
      2015
    • 负责人:
      Alan Haynes
    • 依托单位:
    Diophantine approximation, chromatic number, and equivalence classes of separated nets
    • 批准号:
      EP/L001462/1
    • 项目类别:
      Research Grant
    • 资助金额:
      $29.07万
    • 财政年份:
      2013
    • 负责人:
      Alan Haynes
    • 依托单位:
    国内基金
    海外基金
    非牛顿流方程(组)及其随机模型无穷维动力系统的研究
    • 批准号:
      11126160
    • 项目类别:
      数学天元基金项目
    • 资助金额:
      3.0万元
    • 批准年份:
      2011
    • 负责人:
      郭春晓
    • 依托单位:
    枢纽港选址及相关问题的算法设计
    • 批准号:
      71001062
    • 项目类别:
      青年科学基金项目
    • 资助金额:
      17.6万元
    • 批准年份:
      2010
    • 负责人:
      葛冬冬
    • 依托单位: