# Of the Algorithms, by the Algorithms, for the Algorithms

## Can a bunch of mathematicians make government more representative?

Proof came at a recent joint meeting of the two major American mathematical societies during an afternoon session on ways to use math in the battle against gerrymandering. One audience member argued stridently that Florida's 23^{rd} Congressional District, with its decrepit appendage along the coastline, was the weirdest. Later, that got trumped by Wisconsin's 61^{st} state assembly district, which is split into three pieces. Then again, there's Pennsylvania 12^{th} Congressional, home to John Murtha, which looks like an anchor glued to a sea anemone.

For decades, math and computer science have played a profound role in the drawing of legislative districts. And it's hard to argue that they've improved the process. As the amount of information and computing power available to the gerrymanderers has ballooned, they have gotten much better at surgically crafting districts to their precise desires.

So, with a reapportionment of House seats coming up in just over two years, after the next decennial census, mathematicians are now plotting their revenge. After 2010, most states will redraw their congressional districts to account for population shift, sometimes adding or subtracting seats. It's tough to find many defenders of the status quo, in which a supermajority of House seats are noncompetitive. (*Congressional Quarterly* ranked 324 of the 435 seats as "safe" for one party or the other in 2008.) The mathematicians—and social scientists and lawyers—who gathered to discuss the subject Thursday are certain there's a better way to do it. They just haven't quite figured out what it is.

In theory, it makes wonderful sense to hire an algorithm to do the job. Simply plug in all the requirements for a congressional district—relatively equal population, compliance with the Voting Rights Act, and so forth—and let the nonpartisan processor divvy up the state into sensible, shapely chunks. Algorithms, after all—thanks in part to Google—are having a great decade. In other areas where there's a tremendous mess of disorganized, disparate data, like the Internet or the news, we're quite comfortable letting a series of calculations determine which ones are the most important or interesting.

So, why is an algorithmic solution for congressional redistricting such a pipe dream?

In part it's because it is surprisingly hard to define, or at least reduce to a set of rules, what a "gerrymandered district" is. Writing a formula for drawing districts requires us to define how funny-looking is *too* funny looking. And what *is* funny, anyway?

"The idea is that circles are the best shape for districts," said George Washington University's Daniel Ullman, talking about one school of thought. "Unfortunately, they don't tessellate well." This was apparently a joke, because the room burst out laughing. For the rest of the afternoon, the word *tessellate* never failed to produce giggles. (*Tessellate* means to tile together, as in an M.C. Escher drawing.)

There are more than 30 ways to look at the shape of a district and put a number on how screwed up it is. Many practitioners, for example, have treated the district like a free-standing puzzle piece, finding the center of gravity and calculating the square of the distance of each point from that center—what's known as the moment of inertia in physics. The lower the score, the better; districts that are long and dispersed will have many points far from the center of gravity, while compact districts will have fewer. (There are variations on this method, like summing the squares of the distances between individual people in the district. This way, a district isn't penalized for vast swaths of unpopulated area.)

These calculations are usually grouped under the idea of "compactness" of a district, which has found its way into many state regulations. The most interesting proposal of the afternoon came from a Caltech grad student named Alan Miller, who proposed a simple test: If you take two random people in a district, what are the odds that one can walk in a straight line to the other without ever leaving the district? (Actually, it's without leaving the district while remaining in the state, so as not to penalize districts like Maryland's 6^{th}, which has to account for Virginia's hump.) This rewards neat, simple shapes. But it penalizes districts like Maryland's 3^{rd}, which looks like something out of Kandinsky's *Improvisation 31*.