Some efficiently solvable problems over integer partition polytopes

The integer partition polytope PnPn is the convex hull of all integer partitions of  nn. We provide a novel extended formulation of PnPn, and use it to show that the extremality, adjacency, and separation problems over PnPn can be solved by linear programming without the ellipsoid method.