课题基金 / 基金详情

Designs, colourings and hypergraphs

Designs, colourings and hypergraphs
设计、着色和超图
批准号:
217627-2010
负责人:
Pike, David
金额:
$1.46万
依托单位国家:
加拿大
项目类别:
Discovery Grants Program - Individual
财政年份:
2015
资助国家:
加拿大
项目状态:
已结题
起止时间:
2015-01-01 至 2016-12-31

项目摘要

项目成果

Pike, David的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
The research in this proposal is in the field of discrete mathematics known as design theory. In essence, a design having parameters N, K and L is a mathematical model in which each of N items is a member of several groups where (1) each group contains exactly K items, and (2) each pair of items are found together in exactly L of the groups. For example, if N=7, K=3 and L=1, and if the seven items of the design are represented by the letters A to G then the following seven groups produce a valid design: ABD, BCE, CDF, DEG, AEF, BFG, ACG. Designs can be used to schedule or coordinate situations in which groups with this type of structure are needed. For instance, if a farmer with seven crop varieties to plant wants to sow a mixture of three varieties in each field such that no pair of varieties is grown together in more than one field, then the example design just presented would provide a solution in which varieties A,B,D are planted in one field, B,C,E in the next field, and so forth. Sometimes the items of a design also need to be divided into collections so that no group has all K of its items coming from just one of the collections of items. For example, suppose a farmer can have one of X available treatments for disease control applied to each seed variety; varieties with a common treatment then form one collection. To reduce the risk of crop failure in each field, sowing any field with K varieties that have all had the same seed treatment is to be avoided. The design above cannot be split up into X=2 collections in this manner, but if X=3 then the three collections [A,C,E], [B,D] and [F,G] would achieve the desired result. The research in this proposal will study designs as abstract mathematical objects, and will consider several unsolved problems. One such problem is to prove for each choice of K and X that there exists a design with L=1 and with some number N of items that can be partitioned into X collections, but not into X-1 collections. Several students and post-doctoral fellows will receive advanced mathematical training in conjunction with this research. In addition to helping to advance science, they will be prepared for careers in academia or other settings in which complex analytical skills are required.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Combinatorial Designs, Graphs, and Networks
  • 批准号:
    RGPIN-2022-03829
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.97万
  • 财政年份:
    2022
  • 负责人:
    Pike, David
  • 依托单位:
Combinatorial Designs and Graph Theory
  • 批准号:
    RGPIN-2016-04456
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.6万
  • 财政年份:
    2021
  • 负责人:
    Pike, David
  • 依托单位:
Combinatorial Designs and Graph Theory
  • 批准号:
    RGPIN-2016-04456
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.6万
  • 财政年份:
    2020
  • 负责人:
    Pike, David
  • 依托单位:
Combinatorial Designs and Graph Theory
  • 批准号:
    RGPIN-2016-04456
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.6万
  • 财政年份:
    2019
  • 负责人:
    Pike, David
  • 依托单位:
海外基金