Combinatorics of integer partitions with prescribed perimeter

We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We generalize the two concerned statistics to those of the part-difference less than d and the parts not congruent to 1 modulo d+1 and prove a distribution inequality, that has a similar flavor as Alder's ex-conjecture, over partitions with a prescribed perimeter. Both of our results are proven analytically and combinatorially.