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.

43.614000-116.202000

Advertisements

Like this:

LikeLoading...

Related

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.

The only reference I know for precisely these matters is the handbook chapter MR2768702. Koellner, Peter; Woodin, W. Hugh. Large cardinals from determinacy. In Handbook of set theory. Vols. 1, 2, 3, 1951–2119, Springer, Dordrecht, 2010. (Particularly, section 7.) For closely related topics, see also the work of Yong Cheng (and of Cheng and Schindler) on Harr […]

As other answers point out, yes, one needs choice. The popular/natural examples of models of ZF+DC where all sets of reals are measurable are models of determinacy, and Solovay's model. They are related in deep ways, actually, through large cardinals. (Under enough large cardinals, $L({\mathbb R})$ of $V$ is a model of determinacy and (something stronge […]

Throughout the question, we only consider primes of the form $3k+1$. A reference for cubic reciprocity is Ireland & Rosen's A Classical Introduction to Modern Number Theory. How can I count the relative density of those $p$ (of the form $3k+1$) such that the equation $2=3x^3$ has no solutions modulo $p$? Really, even pointers on how to say anything […]

(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 not possible to provide an explicit expression for a non-linear solution. The reason is that (it is a folklore result that) an additive $f:{\mathbb R}\to{\mathbb R}$ is linear iff it is measurable. (This result can be found in a variety of places, it is a standard exercise in measure theory books. As of this writing, there is a short proof here (Intern […]

Let $s$ be the supremum of the $\mu$-measures of members of $\mathcal G$. By definition of supremum, for each $n$, there is $G_n\in\mathcal G$ with $\mu(G_n)>s-1/n$. Letting $G=\bigcup_n G_n$, then $G\in \mathcal G$ since $\mathcal G$ is closed under countable unions, and $\mu(G)=s$, since it is at least $\sup_n\mu(G_n)$ but it is at most $s$ (by definiti […]

The result you are trying to prove is false. For example, if $a=\omega+1$ and $b=\omega+\omega$, then $a+b=\omega\cdot 3>b$. Here is what is true: first, the key result you should establish (by induction) is that An ordinal $\alpha>0$ has the property that for all $\beta

Very briefly: Yes, there are several programs being developed that can be understood as pursuing new axioms for set theory. For the question itself of whether pursuing new axioms is a reasonably line of inquiry, see the following (in particular, the paper by John Steel): MR1814122 (2002a:03007). Feferman, Solomon; Friedman, Harvey M.; Maddy, Penelope; Steel, […]

This is a very interesting question and the subject of current research in set theory. There are, however, some caveats. Say that a set of reals is $\aleph_1$-dense if and only if it meets each interval in exactly $\aleph_1$-many points. It is easy to see that such sets exist, have size $\aleph_1$, and in fact, if $A$ is $\aleph_1$-dense, then between any tw […]