Unifying voting theory from Nakamura's to Greenberg's theorems

Cycles, empty cores, intransitivities, and other complexities affect group decision and voting rules. Approaches that prevent these difficulties include the Nakamura number, Greenberg's theorem, and single peaked preferences. The results derived here subsume and significantly extend these assertions while providing a common explanation for these seemingly dissimilar conclusions.