For ease, I re-list here all the presentations we had throughout the term. I also include some of them. If you gave a presentation and would like your notes to be included, please email them to me and I’ll add them here.

Jeremy Elison, Wednesday, October 12: Georg Cantor and infinity.

Kevin Byrne, Wednesday, October 26: Alan Turing and Turing machines.

Keith Ward, Monday, November 7: Grigori Perelman and the Poincaré conjecture.

David Miller, Wednesday, November 16: Augustin Cauchy and Cauchy’s dispersion equation.

Taylor Mitchell, Friday, November 18: Lajos Pósa and Hamiltonian circuits.

Sheryl Tremble, Monday, November 28: Pythagoras and the Pythagorean theorem.

Blake Dietz, Wednesday, November 30: and the Happy End problem.

Here are Jeremy’s notes on his presentation. Here is the Wikipedia page on Cantor, and a link to Cantor’s Attic, a wiki-style page discussing the different (set theoretic) notions of infinity.

Here are a link to the official page for the Alan Turing year, and the Wikipedia page on Turing. If you have heard of Conway’s Game of Life, you may enjoy the following video showing how to simulate a Turing machine within the Game of Life; the Droste effect it refers to is best explained in by H. Lenstra in a talk given at Princeton on April 3, 2007, and available here.

Here is a link to the Wikipedia page on Perelman, and the Clay Institute’s description of the Poincaré conjecture. In 2006, The New Yorker published an interesting article on the unfortunate “controversy” on the priority of Perelman’s proof.

Here are David’s slides on his presentation, and the Wikipedia page on Cauchy.

Here is a link to Ross Honsberger’s article on Pósa (including the result on Hamiltonian circuits that Taylor showed during her presentation).

Here are Sheryl’s slides on Pythagoras and his theorem. In case the gif file does not play, here is a separate copy:

The Pythagorean theorem has many proofs, even one discovered by President Garfield!

Finally, here is the Wikipedia page on . Oakland University has a nice page on him, including information on the number; see also the page maintained by Peter Komjáth, and an online depository of most of papers.

This entry was posted on Tuesday, January 10th, 2012 at 5:26 pm and is filed under 187: Discrete mathematics. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

I thought about this question a while ago, while teaching a topics course. Since one can easily check that $${}|{\mathbb R}|=|{\mathcal P}({\mathbb N})|$$ by a direct construction that does not involve diagonalization, the question can be restated as: Is there a proof of Cantor's theorem that ${}|X|

(I am replacing prior nonsense with a completely different suggestion. I am also turning this into CW so details can be added by somebody with time (which, sadly, most likely won't be me). Comments prior to Feb. 9, 2011, refer to said prior nonsense.) Start with $V=L$ and force to add a Mathias real $s$. Let $W$ be the resulting extension. Let $A$ be th […]

(1) Patrick Dehornoy gave a nice talk at the Séminaire Bourbaki explaining Hugh Woodin's approach. It omits many technical details, so you may want to look at it before looking again at the Notices papers. I think looking at those slides and then at the Notices articles gives a reasonable picture of what the approach is and what kind of problems remain […]

It is open whether the continuum hypothesis for an infinite set $E$ implies the well-orderability of $E$. Of course, if $CH(E)$ holds, then the assumption in your (first) statement holds. ($CH(E)$ is the statement that any subset $A$ of $\mathcal P(E)$, either $A$ injects into $E$, or else $A$ is in bijection with $\mathcal P(E)$.) This is a question that da […]

I saw a while ago in a book by Clifford Pickover, that whether $\displaystyle \sum_{n=1}^\infty\frac1{n^3\sin^2 n}$ converges is open. I would think that the question of its convergence is really about the density in $\mathbb N$ of the sequence of numerators of the standard convergent approximations to $\pi$ (which, in itself, seems like an interesting quest […]

Yes, this is inconsistent, and your argument is a way of proving this. In fact, $\mathsf{AD}^*$ is an overkill, and we can prove that there is an undetermined game with $A=\omega_1$. To see this, note that either there is an undetermined game on integers (and we are done), or else $\mathsf{AD}$ holds, so $\omega_1$ does not inject into $\mathbb R$. (The reas […]

For each $i=1,\dots,l$, you have a function $n_i:\{1,\dots,k_i\}\to\{1,\dots,k\}$ where $k_i$ is the arity of $g_i$. Given $x_1,\dots,x_k$, you then define $$ x^i_m=x_{n_i(m)}. $$ So, for instance, you could have $E$-rud functions $h,g,j$ and define $f$ by $$ f(x_1,x_2,x_3,x_4,x_5)=h(g(x_1,x_3,x_5),j(x_2,x_2,x_2,x_1)), $$ with the relevant schema asserting t […]

The answer to your question is negative. The reason is that there are monotone continuous functions $f$ that are singular, that is, for a.e. $x$ we have that $f'(x)$ exists and equals $0$. An example is the Cantor function $f:[0,1]\to[0,1]$: This function is continuous and increasing, with $f(0)=0$, $f(1)=1$, and $f'(x)=0$ for all $x$ in the comple […]

If we ignore some context, and instead consider the quote at face value, it is not Gödel's result that would be relevant, but rather the fact that the theorems of just about any interesting theory do not form a recursive set. This means that there is no computing device that can predict which statements are provable in the theory and which are not. The […]