Resolution lower bounds for the weak functional pigeonhole principle

Abstract

We show that every resolution proof of the functional version FPHP n m of the pigeonhole principle (in which one pigeon may not split between several holes) must have size exp( Ω(n/( log m) 2)) . This implies an exp( Ω(n 1/3)) bound when the number of pigeons m is arbitrary.