Cocktail party math [closed]

Question

Ok, hotshots. You're at a party, and you're chatting with some non-mathematicians. You tell them that you're a mathematician, and then they ask you to elaborate a bit on what you study, or they ask you to explain why you like math so much.

1. What are some engaging ways to do this in general? What are some nice elementary results, accessible to people with any mathematical background or lack thereof, that can be used to illustrate why math is interesting, and its depth, breadth, and beauty? Note the scenario: you're at a party so it should be a relatively quick and snappy kind of thing that doesn't require a blackboard or paper to explain.

2. Easy Mode: How do you explain what your particular sub-field of math is about in an accurate but still understandable and engaging way? Hard Mode: Assuming you work in a less applied area, how can you do this without mentioning any real-world applications? Again, note the scenario.

This question is inspired by this one, in particular Anton's answer.

Answer 1

In parties where people are eating pizza, it is quite nice to see people taking their slice and curving the edge so that the slice stays straight. Then you can tell them that this is effectively Gauss's "Theorema Egregium": the initial Gaussian curvature is zero, so by curving the slice in one direction they force the slice to stay straight in the perpendicular direction.

You can probably continue the discussion talking about rolling pieces of paper into cylinders but not into tori ("doughnuts"), or maybe talking about soap bubbles!

Answer 2

There's no reason to stick to your subfield of mathematics. Nonmathematicians aren't going to care about the difference between category theory and Fourier analysis.

I like to tell people about Arrow's theorem, that the only voting systems which are consistent are dictatorships. Consistency can be illustrated by this joke:

"Would you like tea or coffee?"

"Tea, please."

"Oh, we also have lemonade."

"In that case, I'd like coffee."

That seems silly, but it's what democratic systems do, e.g., in 1992 the American population preferred Bush over Clinton, but with the right wing 3rd party candidacy of Perot, Clinton was elected.

Most people get the joke, and see that consistency might be desirable, and then that mathematics can say some things which are meaningful to them.

Answer 3

One of the things I like to mention, since I study topology, is the Brouwer fixed point theorem. The idea to explain is that if you pick up a piece of paper, DON'T RIP IT, but crumple it, turn it over, fold it, whatever, put it down on top of another one, then there will always be at least one point that will match up with the one below it on the other paper. It's very physical, very counterintuitive, and thoroughly math, though it's better demonstrated with a decorated napkin than plain.

Alternatively, in the same vein, one can talk about the hairy-sphere theorem (the idea that you can't comb a hairy sphere all the way around without a cowlick; i.e., you can't have a nonvanishing continuous vector field along the sphere).

Answer 4

I've always found that a brief description of the Stable Marriage Problem gets people interested. I frame it as a high school dance with n boys and n girls each with a preference relation defined on the members of the opposite sex. Of course I don't call it a preference relation, but that's what it is. I then explain the disaster and heartache waiting if an unstable matching occurs.

I'll pair up people standing around at the party to illustrate the theorem, and get people involved. I'll then close with the fact that the National Resident Matching Program, which places graduating medical students into residence positions, uses the Stable Marriage Theorem to determine those placements.

The example is interesting enough to keep people listening and just technical enough that the answers aren't clear from the outset. If people are still interested you can segway into bipartite graphs and other kinds of matchings or just to graphs in general. Graph Theory is a rich area for cocktail party discussion.

NRMP Site: http://www.nrmp.org/res_match/about_res/algorithms.html

Stable Marriage Problem can be found on Wikipedia. I can't post a second link as a new user.

Answer 5

I have considered some of the lack of knowledge and mistaken impressions of mathematics (and scientific research in general) that can be held by nonmathematicians. In mathematics, there's nothing to prove, just things to calculate. Or all of the important things to prove were established ages ago. Or if there are things still to prove, it's because the remaining questions are incredibly complicated, or incomprehensibly abstract. Or remaining questions could be mystical ones with no right answer, only opinions. Maybe contemporary mathematicians are much smarter than their predecessors because they have powerful computers. In any case, applications — technology, health, some other science that's actually interesting — could be the serious reason to do mathematics. Or if not that, it could be sheer ego and hero worship.

To be fair, a lot of nonmathematicians don't have any such depressing view of our profession. However, they can adopt it very quickly in response to bad explanations. Certainly most nonmathematicians have little sense of the basic coin of research in pure mathematics: theorems, proofs, definitions, conjectures, open problems. They also generally don't know that mathematics was already sophisticated in the 19th century, that a vast amount was accomplished in the first half of the 20th century, and that there are plenty of open problems left. (19th century mathematics is largely invisible in newspapers. On the one hand, very few readers or journalists know any of it; on the other hand, it certainly isn't news.)

To counter every side of that, I like to discuss questions that are not only accessible and fun, but also have a historical narrative. The narrative can go from an easy question, to some 19th or early 20th century result, to open problems. It can also cite great results from mathematicians other than the most famous heroes. I think that this can be done in lots of ways, but it is important to stick to clear explanations. Here is an example and a half:

1. Knot theory. Is an overhand (a trefoil) different from a nothing (an unknot)? Is a right-handed overhand different from a left-handed one? Yes and yes, according to Heegaard, Tietze, and Dehn from a century ago. Are there knots that aren't handed? For example, the figure-eight. Are there non-invertible knots? Yes, but that's harder; it was only established in 1964 by Trotter. Is it possible to distinguish any pair of knots? Yes, as was first proved by Haken in the late 1960s. How would you do it? The current best way is with Thurston's ideas, using hyperbolic geometry. (Hyperbolic geometry is then another big topic.) How many crossings do you need to switch to convert one knot to another? That is a big open problem, although it has been solved in many interesting cases. What's the easiest solution to the first of this whole chain of questions? Reidemeister moves and 3-colorings. Etc.

2. Real algebraic curves. Hyperbolas, parabolas, and ellipses are all quadratic curves. A hyperbola has two branches, but these are halves of one oval that passes through infinity. How many ovals can you have in higher degrees? An indirect argument tells you that you can't have an unbounded number in any fixed degree. In degree 4 you can have 4 ovals; in degree 6 you can have 11 ovals. Harnack discovered and proved these upper bounds in the 19th century. Can the ovals nest any way you like? No...

Answer 6

I researched some properties of words with a limited alphabet, which has applications for genetic modelings. So at a party, I tell people that I model genes.

They do tend to look at me funny after I say it, though.

Answer 7

There are some good ones in topology (or maybe I just know these examples because it's my field).

1. People always seem to think the hairy ball theorem (already mentioned) is interesting because it explain why people have cowlicks on their head, not to mention the name itself usually gets a few giggles.

2. The Meteorological Theorem (Borusk-Ulam) implies there are antipodal points on the surface of the Earth where the temperature and barometric pressure are the same.

3. My favorite one is similar to the plate trick above. If you hold a coffee cup in your hand and rotate your wrist until the cup is oriented the original way--your arm is all tangled up, but if you rotate it again, your arm straightens out. It demonsrates that the fundamental group of the group of rotations in R^3 is Z_2.

4. Vin de Silva, who does works in applied topology, has the best one though. Take a piece of paper draw a few dots on it and ask what the shape it. Draw more until it's clear that you're "sampling" points from a circle. Then tell them that math (persistent homology in this case) lets you find the shape of a sampling of points. Leads to simple discussions of using math to solve lots of applied problems.

Then you can start making jokes using the work "functor." ("Functor? I hardly know her!" or just randomly say "Clusterfunctors!")

Answer 8

Noncommutativity for transformations: when dressing up, you first put on socks, then shoes, when undressing, you have to take off shoes first!

Percentages and interest rates: it sort of matters whether to put 2,000 into your savings account this year and 1,000 the next year or 1,000 this year and 2,000 the next year (not obvious to many people).

Abstract maths can go far from "reality" into the "world of ideas": Banach-Tarski paradox.

And as to the questions like "why do you like maths so much?" I usually prefer to draw parallels between maths and arts/languages (not denying the applications either).

Answer 9

Plate trick.

Answer 10

On computer role-playing forums, I have seen a lot of general strategy advice regarding difficult group battles ("attack the boss monster first", "start with the highest-damage enemies", etc.). I have decided to see for myself which the optimal tactics is. The answer requires some basic (school-level but nontrivial) mathematics: see http://www.mathlinks.ro/viewtopic.php?t=326811 , scroll down to the remark (the problem turned out to be more or less identical to an American Math. Monthly question which is older than CRPG).

Navigation in mazes.

Is it possible to brute-force a combination lock by repeatedly changing a digit without checking one and the same combination several times? (Yes, by induction, at least if you can cycle every digit all the way from 0, 1, 2, ... to 9 and back to 0. If you cannot move between 9 and 0 without going through the intermediate digits, then no, by a semi-invariant argument. The keyword here is Hamiltonian path. If none exists, the next natural question is how to find a path through every vertex of minimal length...) And as we are talking about Hamiltonian paths, Euler paths can be interesting as well...

Huffman coding. It's in your base compressing your files.

For some reason I never understood, many people not particularly close to mathematics seem to be fascinated by Rubik's cube. As opposed to some other popular riddles like Sudoku, this one becomes more or less trivial once one knows the maths behind it.

Huh, the four-color theorem has not been mentioned yet? This is the best example for the notion of beautiful vs. ugly in mathematics that comes into my mind. The five-color theorem is not difficult and rather nice to prove; the only proofs of the four-color theorem known go the "classify and solve for hundreds of particular cases" way. Mathematics is probably the only science where people care for the difference.

The isoperimetric inequality, with all of its, sorry for the pun, variations (such as the case of a curve in a half-plane with two given ends).

You want to encrypt a message in a way that each of $n$ persons gets a key such that any $k$ of them can, in a joint effort, unambiguously decrypt the it, while any $k-1$ will not have the slightest idea about the message (i. e., every possible message including gibberish will be equiprobable). It's called Shamir's Secret Sharing.

Answer 11

In Ramsey theory, there is a theorem that states that if the edges of the complete graph on six points are divided into two sets one set will contain all the edges of a triangle. This could be illustrated by taking 6 people at the party and finding either three that know each or three that don't. This is easy to demonstrate and could be generalized in various ways.

Answer 12

Here's a couple of examples from the Japanese TV show "Coma University of Mathematics". There have been some excellent episodes which are accessible to non-mathematicians yet I think really conveys the creativity in mathematical research, and how very different that is from doing complicated arithmetic.

1. The moving sofa problem: explain that, to get to your room, you have to pass through two corridors, 1m in width, which meet at right angles. What shape of sofa has the largest area but can still get into your room? It's not immediately clear what shapes one should try, and it might surprise your audience that such a simple-looking question is an open problem.

2. The art gallery theorem: in short, how many guards (or CCTV cameras) do you need to cover all of a polygonal art gallery? Again, a problem that's easy to understand, but the proof for the upper bound requires a clever idea.

Answer 13

I'm in applied math so I have it easy: I use math to pick the cancer treatments with the highest probability of being safe and effective.

Answer 14

I like to talk about planarity of graphs, because it's easy to introduce, easy to draw on a napkin, and on the "application" side of things you can mention computer chip design, transportation networks, and other things. The nonplanarity of $K_{3,3}$ can be introduced via the "three utilities" puzzle: you have three houses and you want to connect each one to each of three utilities (water, hydro, gas) -- can you do it without having the lines cross? Similarly the nonplanarity of $K_5$ can be posed as a puzzle, and Kuratowski's theorem basically asserts that these two examples give the only obstructions to planarity: a graph is planar if and only if it contains no subgraph homeomorphic to $K_5$ or $K_{3,3}$.

Going further, you can talk about embedding graphs on a torus (i.e. in a game of Asteroids), for which you can draw examples of embeddings of $K_5$ and $K_{3,3}$, and say that there's an analogy of Kuratowski's theorem (by corollary to the Robertson-Seymour theorem): there is a finite list of "forbidden graphs" which are the only obstruction to a graph being embeddable on the torus, in the sense that any nonembeddable graph contains one of those forbidden graphs as a minor.

Answer 15

One of the issues that came up during the challenger explosion investigation was whether some port had a circular opening. The engineers had taken two parallel planes, placed the port between them, measured the distance between the planes, and then rotated & repeated. Since all the measured distances were equal, they concluded the port was circular.

Anyone who's studied a bit of geometry knows this is an error. There are curves of constant width that are not circles -- a good counterexample is the 50p coin if you have some UK currency.

It's easy to extend this into a discussion of whether manhole covers need to be circular. Any manhole cover that's a curve of constant width cannot fall into its hole.

Answer 16

Especially when talking to engineers, when asked about math I tend to mention a fact I learned in Hilbert's book "Geometry and the Imagination": the two rulings on a quadric surface in 3-space can be used to design gear trains which allow for transferring motion between two arbitrary skew axes of rotation. (Basically, make gears shaped like real hyperboloids of one sheet. There's a picture in Hilbert's book, p. 287.) For some reason I find this a particularly snazzy (albeit very elementary) example of why anybody might care about algebraic geometry.

Answer 17

When people are asking for practical applications (which they inevitably do), I always explain how number theory (that's prime numbers for the layperson) was at some time studied by some people because it couldn't have any application ever (so it's pure and artistic), but now is the basis for cryptography, which is for example behind the banking system; implying that there can be a delay of 50-100 years between a mathematical discovery and a potential everyday application. I also mention that there are often immediate applications inside mathematics, so it's not totally useless :).

Topology has some interesting stuff too, as already mentioned.

Answer 18

I like the following description of the inverse galois problem I came up with at one point:

Do you remember polynomials? Maybe from high school math? Do you ever remember trying to factor polynomials in school? Like for example $x^2 -4$ factors as $(x+2)(x-2)$. So notice that you can get from one factor to the other just by switching from 2 to -2, so this polynomial is symmetric in the simplest way possible, you just hold up a mirror and switch roots from one to the other.

Well every polynomial is symmetric in some way or another, and there are very many ways a polynomial can be symmetric. We as mathematicians know how to take a polynomial and say in a very precise way "What kinds of symmetry does this polynomial have?"

Now, can we go the other way? Can we start with some symmetries and ask for a polynomial that is symmetric in that way? Well, we don't know. We should know, but we don't yet!

Answer 19

I have successfully used examples involving covering chessboards with dominoes. I start with the question about whether you can tile a chessboard with opposite corner squares removed. If this gets any interest, I might go on from there. This leads people to the idea that mathematics is not just about numbers, but is actually about thinking logically about pretty much anything.

Answer 20

A bizarre consequence of the Crystallography Restriction is that one can't have a wallpaper pattern with with fivefold rotational symmetry but one can have 2-, 3-, 4-, and 6-fold rotational symmetry. It's tricky to explain "fivefold rotational symmetry" concisely and precisely, but I just tried this example out on a friend of mine, and I must say his reaction was fairly enjoyable. He found the result unbelievable.

Answer 21

When trying to talk about specific results, I really like talking about Cantor's Theorem (or at least, the special case of $2^{\aleph_0}$), and then, if they're willing to accept that, talk about ordinals a bit. If the audience isn't taking it, I'll generally talk about some arbitrary graph problem that comes to my head.

But when asked, I typically try to approach it from the more philosophic perspective of "what mathematicians do"-- study abstract structure. (Or at least, that's the approach I take to math), and try to explain what that means, providing some examples here and there. The definition of group shows up a lot, since there are easy to understand examples of groups. I also view myself as a bit of an artist, so I tend to use analogies that deal with music and painting.

Answer 22

I have a go-to math fact to bring out at parties when people want to hear one. The cute part is that they can do it themselves.

Take a pen and paper and draw a quadrilateral. There are no restrictions (it can be concave or self-intersecting), but don’t make it too close to the sides of the paper. Now, for each edge, draw the square containing that edge that is outside the quadrilateral. Put a dot in the center of each of the four squares, and draw a line connecting opposite dots, ie, those that came from opposite edges.

The Punchline: The lines you just drew are the same length, and perpendicular.

I wrote it up and drew up a pictoral proof on my (mostly-defunct) blog sometime ago.

Answer 23

Get piece of paper in the shape of long rectangle. Draw the line along long side exactly in the middle of the rectangle. Then make Moebius strip from piece of paper. Finally cut it in the half - You will obtain two pieces of paper. Now make another Moebius strip but now, cut in in say 1/3 from the side along long side of the rectangle ( it is hard to describe as English is not my primary language ) . See what happen. You may ask people to guess before;-)

Do You know Steinhaus http://en.wikipedia.org/wiki/Hugo_Steinhaus book "Mathematical Kaleidoscope"? Read it and You will be ready for any occasion;-)

Answer 24

If you work in Theoretical computer science (or related fields) you can say what Anup Rao says in this article.

Answer 25

I just thought about this a bit more, and wonder whether, with a good set of people who can describe mathematics well, something in the realm of Bill Nye the Science Guy could be created for math. It might end up Geometry heavy, i'm not sure.