Skip to content

Does Every Infinite Geometric Lattice of Finite Rank Have a Matching? A “Challenging Question” of Björner from 1976 02/14/2019

Speaker: Jonathan David Farley, Morgan State University
Date and time: Thursday, February 14, 4-5pm
Place: Rome 352

Abstract. At the 1981 Banff Conference on Ordered Sets (which was attended by such luminaries as Erdős, Garrett Birkhoff, Dilworth, Turing Award-winner D. S. Scott, Richard Stanley, R. L. Graham, and Oxford’s H. A. Priestley), Pólya Prize-winner Anders Björner asked if every geometric lattice of finite rank greater than 1 had a matching between the points and hyperplanes, a question he had called "challenging" in 1976. We answer this question. (If the suspense is too much for you, you may ask the author for a preprint.)