Recent Comments
Advertisements
Monthly Archives: December 2014
A Historical Picture Taken by Nimrod Megiddo
Last week I took a bus from Tel Aviv to Jerusalem and I saw (from behind) a person that I immediately recognized. It was Nimrod Megiddo, from IBM Almaden, one of the very first to relate game theory with complexity … Continue reading
Scott Triumphs* at the Shtetl
Scott Aaronson wrote a new post on the Shtetl Optimized** reflecting on the previous thread (that I referred to in my post on Amy’s triumph), and on reactions to this thread. The highlight is a list of nine of Scott’s … Continue reading
Amy Triumphs* at the Shtetl
It was not until the 144th comment by a participants named Amy on Scott’s Aaronson recent Shtetl-optimized** post devoted to a certain case of sexual harassment at M. I. T. that the discussion turned into something quite special. Amy’s great … Continue reading
Posted in Controversies and debates, Women in science
Tagged Amy, feminism, Shtetl-optimized
23 Comments
@HUJI
Ilya Rips and me during Ilyafest last week (picture Itai Benjamini) Ilya Rips Birthday Conference Last week we had here a celebration for Ilya Rips’ birthday. Ilya is an extraordinary mathematician with immense influence on algebra and topology. There were … Continue reading
When Do a Few Colors Suffice?
When can we properly color the vertices of a graph with a few colors? This is a notoriously difficult problem. Things get a little better if we consider simultaneously a graph together with all its induced subgraphs. Recall that an … Continue reading
From Peter Cameron’s Blog: The symmetric group 3: Automorphisms
Originally posted on Peter Cameron's Blog:
No account of the symmetric group can be complete without mentioning the remarkable fact that the symmetric group of degree n (finite or infinite) has an outer automorphism if and only if n=6.…
Posted in Algebra
2 Comments
Coloring Simple Polytopes and Triangulations
Coloring Edge-coloring of simple polytopes One of the equivalent formulation of the four-color theorem asserts that: Theorem (4CT) : Every cubic bridgeless planar graph is 3-edge colorable So we can color the edges by three colors such that every two … Continue reading
TYI 25: The Automorphism Group of the Symmetric Group
True or False: The group of automorphisms of the symmetric group , n ≥ 3 is itself.
