## Three 35 Minute Lectures

- The first will be given using a slide show, and the second will be a blackboard talk. Students are free to choose either for the third talk.
- The first and second will be given on a chapter of "
*Proofs from THE BOOK*". Students may choose other topics, after coordinating with the instructor. - The last lecture will be given on an independently chosen topic.
- Students are required to give a practice talk, either to a peer or to the instructor (at the instructor's discretion).
- Students must furthermore prepare a short quiz for the end of their talk, which should take no more than 5 minutes to solve and be easy for anyone who paid attention.

### Guidelines for Giving Lectures

- Talking about something that you find beautiful and understand well makes it easier to give a good lecture. Make sure you choose topics that you like, and study them well.
- Find your own style of talking; there is no universal way to give talks.
- The goal of the lecture is to teach math to your peers. Whatever you do that achieves that goal is good! Not to be confused with
- demonstrating to the instructor that you understand the subject, or
- reading out loud the paper / book chapter that you are presenting.

- Encourage the audience to ask questions. After explaining a subtle point give them time to think about it before you move on. Maintain eye contact with them to make sure they are still with you.
- You do not have to prove
*everything*formally, but you should prove*something*formally and make sure the audience has an idea of how the rest was proved. - Talk slowly; the bottleneck of a talk is not how fast you can speak, but how fast the audience can understand. Plan to have some spare time to answer questions, make mistakes etc. This will also help you be more relaxed.
- Slide shows:
- Don't put more than 4 lines on each slide,
- consider using LaTeX
*beamer*rather than WYSIWYG software like PowerPoint (a LaTeX beamer template (TEX) is available) - give the audience time to read each slide, and
- use figures!

- Also, come 10 minutes before your lecture to make sure your computer connects properly to the projector.

Students are strongly encouraged to meet the instructor while preparing their talks to discuss mathematical content, delivery strategy, or any other issues.

## Short Paper

- Write a short (2 to 4 page) paper on the topic below. Papers must be written in LaTeX.
- Prove the following theorem regarding asynchronous majority dynamics:
- The synchronous analogue of this theorem appears in "Periodic Behaviour of Generalized Threshold Functions." by E. Goles and J. Olivos, Discrete Mathematics, 1980.
- Paper outline:
- No need to define graphs.
- Define majority dynamics (asynchronous).
- Define L
_{t}. - Prove the following:
- Prove the theorem.

**Lemma.***L*._{t}is non-increasing - Those who want more of a challenge can prove the following:

**Theorem.** *Let G=(V, E) be a finite, undirected simple graph with odd degrees. Then, for any initial opinions and any update sequence, the size of the set {(u,t) | X ^{u}_{t} *

*≠*X^{u}_{t-1}} is at most |E|.**Theorem.** *Let G be a graph of bounded maximal degree, and such that the number of edges at distance r from some vertex w is bounded from above by a polynomial in r. Then there exists a C > 0 such that for any initial opinions and any update sequence, the total number of times that X ^{w}_{t} ≠ X^{w}_{t-1} is at most C.*

## Very Short Paper

- Write a proof of the six color theorem using the chromatic.tex template (TEX).
- You can make changes to the template if you wish, but the only requirement is to fill in the proof of the theorem. There's no need to prove the lemma.
- Hint: Prove by induction on the size on the graph. Another possibility is to assume by contradiction that the theorem is false, and proceed by analyzing a smallest graph that violates it.

## Final Paper

- Write a final paper on the topic of the last talk. This will include handing in a paper outline, a first draft, a second draft (if necessary) and a final draft. Papers must be written in LaTeX.
- The paper should be 10 or more pages long, including about 5 or 6 pages of proofs.
- Papers must be written in LaTeX and a LaTeX template (TEX) is available.
- Don't plagiarize.