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.

Georgii: Let me start with some brief remarks. In a series of three papers: a. Wacław Sierpiński, "Contribution à la théorie des séries divergentes", Comp. Rend. Soc. Sci. Varsovie 3 (1910) 89–93 (in Polish). b. Wacław Sierpiński, "Remarque sur la théorème de Riemann relatif aux séries semi-convergentes", Prac. Mat. Fiz. XXI (1910) 17–20 […]

What precisely do you mean by a standard model? An $\omega$-model? (That is, a model whose set of natural numbers is isomorphic to $\omega$.) Or a $\beta$-model? (That is, a model whose ordinals are well-ordered.) If the latter, the Mostowski collapse theorem tells us any such model is isomorphic in a unique way to a unique transitive model. If the former, t […]

This is Theorem 39 in the paper (see Theorem 4.(i) for a user-friendly preview). But the fact that $(2^\kappa)^+\to(\kappa^+)^2_\kappa$ is older (1946) and due to Erdős, see here: Paul Erdős. Some set-theoretical properties of graphs, Univ. Nac. Tucumán. Revista A. 3 (1942), 363-367 MR5,151d. (Anyway, it is probably easier to read a more modern presentation, […]

This is a nice problem. Here is what I know. (Below, I refer to the Handbook. This is the Handbook of Set Theory, Foreman, Kanamori, eds., Springer, 2010.) First of all, the consistency of the failure of diamond at a weakly compact cardinal seems open. Woodin has asked this explicitly, I do not know if the question itself is due to him. Of course, $\diamonds […]

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|

An example I like is this: Say two sets of natural numbers are almost disjoint iff they are infinite but their intersection is finite. Suppose $\mathcal F$ is an uncountable family of almost disjoint sets. Then the collection of characteristic functions of the sets in $\mathcal F$ is an example. (If $A$ is a subset of $\mathbb N$, then its characteristic fun […]

The set $\mathrm{Def}(X)$ consists of all subsets of $X$ first-order definable in the structure $(X,\in)$ from parameters. What matters here is that there are only countably many formulas, and only $|X^{

There is no slowest divergent series. Let me take this to mean that given any sequence $a_n$ of positive numbers converging to zero whose series diverges, there is a sequence $b_n$ that converges to zero faster and the series also diverges, where "faster" means that $\lim b_n/a_n=0$. In fact, given any sequences of positive numbers $(a_{1,n}), (a_{ […]

Yes. In fact, by a counting argument, most dense co-dense sets are neither $G_\delta$ nor $F_\sigma$. The point is that there are exactly as many $G_\delta$ or $F_\sigma$ as there are real numbers, but there are as many dense co-dense sets as there are sets of real numbers. In somewhat more detail: There are only countably many rationals, so there are counta […]

There are quite a few examples in analysis, typically through the use of transfinite induction or transfinite recursion of length $\omega_1$. The Baire-Cantor stationary principle states that if $C_0\supseteq C_1\supseteq C_2\supseteq\dots\supseteq C_\alpha\supseteq\dots$, $\alpha