The afternoon was off to a good start for the blogging team. We started at the MAA Project NExT reception to celebrate 25 years of Project NeXt. We met fellow NExTers and got some valuable lessons on networking etiquette from NExT director David Kung and current AMS Congressional Fellow James Ricci. Apparently one should always say “nice to see you” rather than “nice to meet you” just in case, and you should always hold your drink in the left hand to avoid the dreaded clammy handshake (a piece of advice that I apparently failed to internalize).
Your faithful bloggers take an afternoon respite at the MAA Project NExT champagne and cake reception.
Age is a funny thing. I feel kind of old when I see all my friends either here with their infants and children, friends who are expecting, or friends who are happy to be able to get some sleep because they left their children with a spouse or other caregivers (even though they clearly miss their kids too, as evidenced by their showing me all of the cute kids pictures possible). When did everyone start having kids? And how will I get to hold and play with them all? Auntie Adri is reporting for duty.
I’m at this talk by Dan Spielman of Yale University, who’s trying to give us an introduction to spectral and algebraic graph theory. I’m here because he was my friend’s undergraduate advisor and my friend said that “Professor Dan” is great! Dan has won a ton of fancy prizes and there are so many people in the audience to watch him.
This talk wove together computer science, graph theory, physics in a very engaging manner. It was a lot of fun, and any errors in this blog post are mine alone, which is embarrassing because I should know a fair amount of spectral graph theory and group theory (I even did my senior math seminar at Yale in spectral graph theory in 2010. Woof.)
In spectral graph theory, we relate graphs to matrices. The first example is an adjacency matrix, where you label the vertices of a graph and then use those labels as row/column labels for a square matrix, and put a “0” when there is no edge between the corresponding vertices, and a “1” if there is such an edge.
Dan: “I think it’s an accident that the adjacency matrix is useful.” He’ll go on to talk about associated matrices, linear equations, quadratic forms, and operators that are less accidental.
Quadratic forms give us some beautiful theorems about graphs.
Shoot, I accidentally sat right next to Anna Haensch, who was also planning on blogging and who co-writes the great AMS Blog on Math Blogs. Well, I’m taking it. Also, it was nice to meet Anna! We’ve talked on the internet but haven’t met before. And Adriana Salerno, the editor of this blog, live-tweeted the talk.
Diana Davis at the Math is Beautiful booth in aisle 200 of the exhibit hall.
There is so much beautiful math in the exhibits hall–seriously, there is no way I could give a survey of everything down here! So instead I’ll just share a snapshot (or a few) of one of the great exhibitors. Diana Davis is a mathematician studying periodic billiard paths (primarily on pentagons!), a Visiting Assistant Professor at Swarthmore, and Artist/Creative Chief/CEO of Math is Beautiful (“But it’s just me,” Diana says when I run this title by her–yes, she is the sole employee of her small company). She makes and sells earrings, coasters, T-shirts, and other items featuring her mathematical creations/discoveries and social justice. I stopped by to see Diana’s Math is Beautiful booth in aisle 200 of the exhibits hall (100 level of the Baltimore Convention Center). She also has two beautiful pieces in the Mathematical Art Exhibit (right next to her booth in the Exhibits Hall).
We encourage your comments, and hope you will join the discussions. Comments are reviewed before they are posted, and those that are offensive, abusive, off topic or promoting a commercial product, person or website will not be posted. Expressing disagreement is fine, but mutual respect is required.