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

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.

I am looking for references discussing two inequalities that come up in the study of the dynamics of Newton's method on real-valued polynomials (in one variable). The inequalities are fairly different, but it seems to make sense to ask about both of them in the same post. Most of the details below are fairly elementary, they are mostly included for comp […]

Let $C$ be the standard Cantor middle-third set. As a consequence of the Baire category theorem, there are numbers $r$ such that $C+r$ consists solely of irrational numbers, see here. What would be an explicit example of a number $r$ with this property? Short of an explicit example, are there any references addressing this question? A natural approach would […]

Not necessarily. That $\mathfrak m$ is consistently singular is proved in MR0947850 (89m:03045) Kunen, Kenneth. Where $\mathsf{MA}$ first fails. J. Symbolic Logic 53(2), (1988), 429–433. There, Ken shows that $\mathfrak{m}$ can be singular of cofinality $\omega_1$. (Both links above are behind paywalls.)

Ignas: 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. […]

MR2449474 (2009j:03067) Woodin, W. Hugh. A tt version of the Posner-Robinson theorem. Computational prospects of infinity. Part II. Presented talks, 355–392, Lect. Notes Ser. Inst. Math. Sci. Natl. Univ. Singap., 15, World Sci. Publ., Hackensack, NJ, 2008. The proof is nice, invoking both recursion-theoretic and set-theoretic tools. Hugh uses a Prikry-like f […]

There is a general argument without choice: Suppose ${\mathfrak m}+{\mathfrak m}={\mathfrak m}$, and ${\mathfrak m}+{\mathfrak n}=2^{\mathfrak m}$. Then ${\mathfrak n}=2^{\mathfrak m}.\,$ This gives the result. The argument is part of a nice result of Specker showing that if CH holds for both a cardinal ${\mathfrak m}$ and its power set $2^{\mathfrak m}$, th […]

By Fermat's little theorem, $t^p\equiv t\pmod p$ for any $t$, so if $p\mid x^p+y^p$ then in fact $p\mid x+y$ (or $y\equiv -x\pmod p$). Now, since $p$ is odd, $$x^p+y^p=(x+y)(x^{p-1}-x^{p-2}y+x^{p-3}y^2-\cdots+y^{p-1}).$$ The first term is a multiple of $p$, as explained above. The second is $$\sum_{k=0}^{p-1}(-1)^k x^{p-1-k}y^k=\sum_{k=0}^{p-1}x^{p-1-k} […]

Your idea is sound, but it requires more work. As pointed out, you have only described so far a very small subcollection of the Borel sets. Instead, show that you can associate to each Borel set a code that keeps track of the "history" of its construction starting from basic open sets, and then count the number of such codes. There is a lot of leew […]

Recently, I was reading Hardy's Orders of Infinity (available here or here): Godfrey Harold Hardy. Orders of infinity. The Infinitärcalcül of Paul du Bois-Reymond. Reprint of the 1910 edition. Cambridge Tracts in Mathematics and Mathematical Physics, No. 12. Hafner Publishing Co., New York, 1971. MR0349922 (50 #2415). The book discusses this result, so […]