vix.ing · top · new · best · stats · spec

A "Challenging Question" of Björner from 1976: Every Infinite Geometric Lattice of Finite Rank Has a Matching

2020/04/24 by Farley, Jonathan David
#03E05 #05B35 #05D15 #06C10 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2004.11972

Abstract

It is proven that every geometric lattice of finite rank greater than 1 has a matching between the points and hyperplanes. This answers a question of Pólya Prize-winner Anders Björner from the 1981 Banff Conference on Ordered Sets, which he raised as a "challenging question" in 1976.

Related