The Mathematical Work of Bernt Lindström
暂无分享,去创建一个
[1] Martin Aigner. Combinatorial search , 1988 .
[2] R. A. Main,et al. Non-Algebraic Matroids exist , 1975 .
[3] I. Gessel,et al. Binomial Determinants, Paths, and Hook Length Formulae , 1985 .
[4] Thomas A. Dowling,et al. Whitney Number Inequalities for Geometric Lattices , 1975 .
[5] Daniel J. Kleitman,et al. Minimally Distant Sets of Lattice Points , 1993, Eur. J. Comb..
[6] Curtis Greene,et al. The Möbius Function of a Partially Ordered Set , 1982 .
[7] Michael E. Saks,et al. Lattices, mobius functions and communications complexity , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[8] I. Anderson. Combinatorics of Finite Sets , 1987 .
[9] H. Wilf. Hadamard determinants Möbius functions, and the chromatic number of a graph , 1968 .
[10] H. S. Shapiro,et al. A Combinatory Detection Problem , 1963 .
[11] John R. Stembridge,et al. Nonintersecting Paths, Pfaffians, and Plane Partitions , 1990 .