Carnival of Mathematics #21: Bar-hopping at last

Well, the Carnival of Mathematics (by my count) is turning 21. I know it’s quite a party here, but I’m not allowed to put images of the blog’s secret lair on the internet, so you’ll have to imagine an appropriate level of debauchery.

To start things off, we’ll have a selection from everyone’s favorite math-flavored webcomic, xkcd:

Odd fact of the day: not only does Randall Munroe write an awesome webcomic, he also has a ballpit in his living room.

Lieven LeBruyn posts some preliminary but interesting looking stuff about a series of finite simple groups which calls Inguanodon series of simple groups (to see the guts of his construction, see the inguanodon dissected). The idea that the sporadic simple groups should fit into infinite series of something has been kicked around by various authors of this blog, but from a somewhat different perspective. LeBruyn seems to be working on the idea that there should be lots of different series of finite simple groups, which start overlapping with the classical series for large values, but include the sporadic groups in their small values.

Math for Mortals uses A problem courtesy of Shakespeare (which doesn’t match too well with my recollection of the Merchant of Venice, but let’s not quibble) as a jumping off point for a discussion of basic logic. However, I think the lesson that using logic can help you avoid execution is a good one.

In case you haven’t been keeping up with the latest on the arXivotubes, the curiously-named 11011110 obligingly catches us up on Six recent arXiv papers. I’ll let him do the summarizing, but will mention that a lot of wacky combinatorics was involved. I think if everyone would write a little summary of the arXiv papers they had read and understood for the benefit of humanity, the internet (and the arXiv) would be a better place. Too bad I’m too lazy to do so.

Math Less Travelled does a 4-part post on Perfect numbers, part I (and part II and part III, with a challenge in between). It’s a pretty elementary subject, but one that people have been unable unlock all the mysteries of centuries later. Funnily enough, one his suggested challenges isn’t finding the first odd perfect number.

JD2718 has another challenge, entitled McRib. I think it might be a bit easier than that odd perfect number bit.

Vlorbik pretends to be confused about why this post was his most popular in months. I think it might have something to do with the fact that it’s entirely about Legos. Of particular interest (though I bet a lot of you have seen it before) is Andrew Lipson’s Mathematical LEGO Sculptures. Yes, it is as awesome as it sounds.

360 gives a couple of more fun posts for the holiday season: one on the ties between Tryptophan and Game Theory (hint: if you were planning on challenging friends and family to a friendly round of Prisoner’s Dilemma, you may have missed your chance), and one on The Rubik’s Hypercube. As if the original wasn’t hard enough.

Blake Stacey complains a bit about Baggage, and the mathematical inconsistencies of airline baggage rules. I wish I could say that that was prime amongst MY travel worries.

Mikael Vejdemo Johansson gives a command (at my command, in fact!) performance at the Infinity Seminar explaining a bit about The Computation of A_\infty-Structures. It was a helpful post (for me), but I still only like computing A_\infty-structures when they’re trivial. At his own blog, he tells us about Wreath Products (which sort of sounds like it might be Christmas-related, but thankfully, is not).

Jeffrey Shalit has done something that I hope we’ll see quite a bit more of in the future: blogging on the work of one of his students. He gives a down to earth description of some of Narad Rampersad’s Work on Combinatorics on Words. I’ll admit, I don’t think I’ve ever thought much about the combinatorics of infinite words, but it looks pretty cool now.

Gary Laden ruminates for a bit on the question: Is There a Black Box in your Research Methodology? It’s not an issue for most of us, but it will probably start to loom as more mathematicians integrate computers into their research. I think it is just one more important reason to lean toward open source software, but on the other hand, I doubt any of us will be giving up Mathematica any time soon (at least until omath is actually functional).

Larry Ferlazzo points us to a website containing clips of math appearing in movies (loosely interpreted) in Math Movies And More. Never again will a group of mathematicians have to rent “It’s My Turn” just to watch the proof of the snake lemma in the first 5 minutes. Not that anyone I know has ever done that. The Monty Python clip of the international philosophy game (Greece vs. Germany) come highly recommended.

Reasonable Deviation has a very interesting, though pretty sketchy post on Smooth Sorting. Basically, someone has cooked up a system of ODEs which will sort numbers by just letting time run. If only someone would now write a post explaining why it works. Well, maybe next carnival. Anyways, definitely the winner of the coolest video award for this installment.

Mark Dominus reminds us in Lazy square roots of power series that it’s easy to say “just take the square root of this” and another thing entirely to convince a computer to do it for you. I can’t comment on the quality of his code, but I applaud the effort.

meeyauw treats us to a voluminous educational post on Boxes Without Topses and Pentominoes. It sounds like good activity to try with Tetris-loving schoolchildren (is there any other kind?).

Of course, what would a blog carnival be without the Fields medalist section? When looking for a good post from Terry Tao, of course, the carnivalist is spoiled for choice. One of the more interesting selections lately was On the property testing of hereditary graph and hypergraph properties. (As you may note, this post also played on my school spirit [institute spirit?] by name-checking by current intellectual home). As many of you know, there are a lot of interesting properties of graphs which is rather hard to check with 100% reliability, but it turns out, there some rather interesting things to say about more probabilistic tests.

For those of you looking for deep discussion of various innocuous seeming bits of linear algebra, look no further than Tim Gowers’s post on The exchange lemma and Gaussian elimination. Linear algebra may not sound like the most scintillating topic, but if Tim discovered facts about linear algebra that surprised him, it probably worth a look from the rest of us.

On his blog, Alain Connes gives (the first part of) his view of The heart of non-commutative geometry and explains what he means by “noncommutative spaces generate their own time.” Make sure you scroll down to the discussion between Connes and Urs Schreiber in the comment section. Whatever issues comments have, they do let us listen in on a lot of very interesting discussions.

John Armstrong (definitely not a Fields medalist) provides us a discussion of Faulhaber’s Famous Formula. Those of you who who haven’t encountered its fame, might learn a little something.

The n-Category Café marches on with blogging John Baez and Jim Dolan’s Geometric Representation Theory course. (The link is to lecture 12). This particular lecture is somewhat dear to my own heart because it involves the connection between braid groups and flag varieties, the multitudinous variations of which are among my favorite stories in mathematics. There’s a lot of exciting connections there they had no time for in this lecture, but I still recommend watching.

If that wasn’t enough about the symmetric group for you, have a look at Isabel’s post on Pattern Avoidance (and another) in the symmetric group. Any of you who like geometry better than combinatorics might still want to take a look. She doesn’t say anything about in the post, but in fact, the pattern avoidance of a permutation is intimately connected with the geometry of the corresponding Schubert varieties (see, for example, this paper and references therein).

Well, I hope you enjoyed the Carnival as much as I did. Start getting ready for the next installment at Wild about Math on December 14th, and keep on bloggin’.

32 thoughts on “Carnival of Mathematics #21: Bar-hopping at last

  1. As one of the aforementioned critics of carnival level, let me hereby applaud you for this issue.

    Furthermore – I see my caching hasn’t been updated on this blog-computer-combination. My name needs an update – since August 25th, it’s Mikael Vejdemo Johansson and not Mikael Johansson.

    Finally – our interests in A∞ seems to be almost perfectly disjoint. I find, for the application of A∞-algebras, Koszul algebras pretty boring. I like Koszularity in general, but seriously – trivial structure? When you can find So Much More?

  2. Here I was thinking “what, did every math blogger except me end up in this carnival?”

    and then there I was.

    I promised myself that I’d try to figure out what was going on with the smooth sorting, but I haven’t done so yet.

  3. Whoops, sorry about the name. It’s fixed now.

    On the subject of A_\infty-algebras, I think this is just a matter of what you want to use them for.

    Formal A_\infty-algebras are a bit like abelian groups. Sure, if what you want to do is study the internal structure of groups because groups are awesome, the abelian ones seem pretty boring (though I seem to recall you have discovered some interesting facts about them). But when you discover a group out in nature you have no reason to believe is abelian, and it turns out to be, that is telling you something very interesting. Lately, some formal A_\infty-structures have been like that for me.

  4. Great carnival! I wish much more mathematicians start blogging (real ones, not students like me).

    It doesn’t have to be very often or time-consumming, there are just so many interesting areas with no blog input yet: hyperbolic groups, SLE, symplectic topology and so on. For instance it’s entirely possible to blog after a paper has been submitted, if that’s an issue…

  5. And as I said, I find all things Koszul absolutely awesome. Which in turn makes “The A∞-structure is formal” an equally awesome statement.

    I really like your analogy. Mind if I steal it (attributed) for the thesis? Probably won’t end up more than an epigraph, but it’s cooooool.

  6. I really like your analogy. Mind if I steal it (attributed) for the thesis? Probably won’t end up more than an epigraph, but it’s cooooool.

    I don’t mind at all. After all, I’m not above stealing an analogy or too.

  7. Ah, mathematicians !!

    11011110 is 0xDE in hexadecimal, which stands for David Eppstein :)

    that’s why you need us computer scientists around ;)

  8. This is fun, thanks. It’ll take some work to discover what’s just above my head (and accessible, if I work at it) and what blows me away, but hey, that’s the challenge.

    All that combinatorial stuff, is that ‘hot’ just about now?

  9. Did you know that our very own Soroosh Yazdani (he’s our very own since he is on our masthead) also has written a paper with the above mentioned Jeffrey Shallit concerning combinatorics on infinite words?

    No, no, I did not. What else has Soroosh been keeping from me?

    All that combinatorial stuff, is that ‘hot’ just about now?

    Probably it depends a lot on who you ask. I tend to think of combinatorics as the sort of subject that has little hope of ever becoming properly fashionable (it involves getting your hands too dirty), but of course, I’m not a combinatorialist.

  10. Well, my blog didn’t make it, so here it is:
    Is this fair of me to put it in a comment? Also, why was it not posted? It qualifies according to the criterion you gave: “mathematics of all levels from kindergarten to ….” Is there some other criterion you did not mention? I know none of the words you learn as PhDs, but my proof is solid. As to the importance of my proof, I have no idea, but it is important enough to me for me to pursue it. As to the originality, I have no idea; I would greatly appreciate any pointers. My best guess is it is the start of a new geometry, similar to incidence geometry, but different. That’s important, right?

  11. randomwalker-

    Well, we’ll see how many posts of that length you can write without making any mistakes. I guess is that the number is small and finite.

  12. Paul-

    I exercised my editorial discretion, and decided not to include your post (I hope that’s not a blog carnival faux pas). You’re free to link to it in comments, of course.

    As to why…well, first of all, as far as I can tell, your “sidedness geometry” sure looks like a subset of linear programming/polytopic combinatorics. Of course, I might be wrong, in which case I hope to see a post explaining the difference in the next blog carnival.

    Also, you have to admit, it’s not a very festive post. There’s no motivation, basically no discussion, and I didn’t find it particularly easy to read. It looks like the first draft of a research article, and a blog carnival isn’t really the place for that.

  13. Ben,

    Nice job with the Carnival. I slept through this Carnival, forgetting to submit a piece but I’ll definitely be awake when it’s my turn to host next. Please correct the date of the next Carnival. It’s DECEMBER 14th, not January.


  14. Wow, that’s a really good edition – thanks, Ben. In your honor, I decided to finally link to all the posted editions on the main carnival page, which I hadn’t been doing since September.

Comments are closed.