On the Chvátal rank of the Pigeonhole Principle

We demonstrate that the Cutting Plane (CP) rank, also known as the Chvátal rank, of the Pigeonhole Principle is Θ(logn). Our proof uses a novel technique which allows us to demonstrate rank lower bounds for fractional points with fewer restrictions than previous methods. We also demonstrate that the Pigeonhole Principle has a polynomially sized CP proof.