Beta The Briev beta is out. Free on iPhone via TestFlight — install it in under a minute.

Join the beta ↗
Briev
Live
Politics

How Geometry and Algorithms Expose the Mechanics of U.S. Gerrymandering

Mathematical tools reveal how district shapes can let a losing party win a majority of seats, a practice known as gerrymandering.

Using geometry and computer science, scholars demonstrate how the layout of voting districts can distort representation in plurality elections. By manipulating boundaries, a party that loses the popular vote can still capture a majority of congressional seats, a tactic called gerrymandering. Historical cases in New York (2012), Pennsylvania (2012) and Florida illustrate large gaps between vote share and seat share.

Researchers have devised the efficiency gap metric and developed algorithms that generate millions of possible district maps, revealing systematic advantages for one party in many states. The work also shows that natural voter clustering, such as urban Democrats, can produce “natural gerrymandering” even with compact districts. Some states now rely on independent commissions and computational tools to draw more equitable maps, though legal challenges persist.

Why it matters

Understanding gerrymandering helps voters see how district design can skew election outcomes and affect representation.

In this story

gerrymanderingredistrictingefficiency gapdistrict compactnesspartisan biaselectoral districtsalgorithmic mapping
Get the beta ↗