Problem section - Jaeger's conjecture

被引：0
|
作者：
Blokhuis, Aart [1 ]
机构：
[1] Tech Univ Eindhoven, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
来源：
COMBINATORICS PROBABILITY & COMPUTING | 2006年 / 15卷 / 04期
关键词：
D O I：
10.1017/S096354830500711X
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A problem based on the questions posed by Francois Jaeger in the year 1981 at a combinatorics in Eger, Hungary, is discussed. Francois Jaeger is mostly known for his work in Knot Theopru and in his discovery of the connections between link invariants and the Bost-Mesner algebra of certain association schemes. A more general version of his question deserves the name Jaeger's Conjecture. Ball and Lavrauw's version of Alon and Tarsi's proof of Jaeger's Conjecture is presented.
引用
收藏
页码：627 / 629
页数：3
相关论文
共 50 条
12345