课题基金 / 基金详情

Infinite Antichains of Combinatorial Structures

Infinite Antichains of Combinatorial Structures
组合结构的无限反链
批准号:
EP/J006130/1
负责人:
Robert Laurence Francis Brignall
金额:
$11.7万
依托单位:
依托单位国家:
英国
项目类别:
Research Grant
财政年份:
2012
资助国家:
英国
项目状态:
已结题
起止时间:
2012 至 --

项目摘要

项目成果

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
Some of the most celebrated results in combinatorics of the last 50 years concern the study of well-quasi-ordering of combinatorial structures, i.e. the existence, or otherwise, of infinite antichains for objects such as graphs, tournaments or permutations under various natural orderings. In certain cases no infinite antichains exist (for example graphs under the minor ordering), but in others they do exist, and for some structures they appear in abundance. Recent research by the PI has developed a general construction for infinite antichains of permutations, which it is expected to give a technique that can be used more generally for other combinatorial structures. The first objects that this will be extended to are those that can be described as "relational structures": these include graphs, tournaments, permutations and posets.Essentially the only infinite antichains that we need to consider in the study of well-quasi-order are "fundamental" ones, which satisfy certain additional properties that ensure they have no redundant structure. The antichain constructions developed by the PI not only add to the body of evidence that the fundamental antichains in fact have a much more regular structure than is guaranteed by their definition, but also suggest the nature of this regularity. This has led the PI to hypothesise that the fundamental antichains of combinatorial structures have a "spine" -- a blueprint from which all but finitely many of the antichain elements are created.Taking a unified viewpoint, this proposal is designed to investigate aspects of this hypothesis by advancing the study of infinite antichains in general, drawing on and strengthening the connections between the various structures. The starting point lies with the existing results for permutations. These will be extended and translated to graphs and other relational structures, where different techniques exist and can be applied. This will enable "cross-fertilisation" to occur, and consequently a more complete theory of infinite antichains can be built to provide evidence for or against the PI's hypothesis.
期刊论文(8)
专著(0)
科研奖励(0)
会议论文
Split Permutation Graphs
分割排列图
DOI: 10.1007/s00373-013-1290-3
发表时间: 2013
期刊: Graphs and Combinatorics
影响因子: 0.7
作者: [Korpelainen N]
通讯作者: Korpelainen N
DOI: 10.1002/jgt.22037
发表时间: 2017-04-01
期刊: JOURNAL OF GRAPH THEORY
影响因子: 0.9
作者: [Brignall, Robert, Korpelainen, Nicholas, Vatter, Vincent]
通讯作者: Vatter, Vincent
Dominating induced matchings in graphs without a skew star
在没有斜星的情况下主导图中的诱导匹配
DOI: 10.1016/j.jda.2013.11.002
发表时间: 2014
期刊: Journal of Discrete Algorithms
影响因子: --
作者: [Korpelainen N]
通讯作者: Korpelainen N
Large infinite antichains of permutations
巨大的无限排列反链
DOI: --
发表时间: 2013
期刊: Pure Mathematics and Applications
影响因子: --
作者: [Albert, M.H.]
通讯作者: Albert, M.H.
7
    海外基金