*
*

- Send me email (click here and delete "QQQ")
- Homepage: http://www.math.uconn.edu/~troby
- Math Dept. Office: MBS M404, phone: 860-486-8385

- Q Center Office: CUE 123, phone: 860-486-4433

- Office hours: Tuesday 2-3 in CUE 123 and by appointment. I'm happy to answer questions or schedule appointments anytime by email, which I check frequently.

* GENERAL DESCRIPTION:* The project consists of two parts: a
written paper of 6-10 pages (single spaced), and a 20-minute
presentation, with 5 minutes for questions.

* PAPER:* The paper should be clearly written and
comprehensible by the other students in the class. The final version
will be due the last day of class; a good first draft is due on 6 April
2006. I will read this and suggest revisions for you to implement in
the final version. The bulk of the paper must be typeset, but you may
handwrite complicated mathematical formulas or diagrams if necessary.

A good paper will include: motivating background information, clear definitions, interesting examples, one or two main results, and some nontrivial proofs. Pictures and diagrams are welcome.

* TOPICS:* There are many interesting and accessible topics in
combinatorics. Here is a list of possibilities. If you find one
interesting, first see what you can find out on the web about it,
including pointers to books and math papers. I'll also be happy to
guide you to accessible places, but would like to see what you're able
to find on your own. (I expect to learn quite a bit!)

- Ramsey theory
- Mathematics of juggling
- Graphical partitions
- Threshold graphs
- f-vectors of polytopes
- Kruskal-Katona theorem
- Partition identities
- Latin squares and Sudoku
- Cryptographic applications
- Graph coloring
- Dilworth's Theorem for partially ordered sets
- De Bruijn sequences
- Gray codes
- Something else (check with me before going too deep)

* PRESENTATION:* The presentation should last 20 minutes
(which is both shorter and longer than it first seems). Rather than
reading your paper, you need to think about how to present the material
most effectively in an oral presentation. Technical details and
detailed proofs should be avoided in favor of giving listeners a feel
for the subject and why they should find it interesting. This is not a
license for sloppy statements, but if you need to be vague about
something too technical to present in a short amount of time, 'fess up.

- Alon Dagan: Trees & electrical networks
- Diana Ettinger: Posets, theorems of Dilworth and Sperner
- Jackson,John J.: Partition identities
- Marianne Larosa: Sudoku and Latin squares
- Isaac Maycotte: Eulerian Numbers
- Brianna Rosen: Catalan Numbers
- Kevin Tyler: Rubik's cube and Polya counting
- Daniel Wakefield: f-vectors of polytopes

You should probably use some sort of projector, either overhead transparencies or from a laptop, although writing on the blackboard might be appropriate instead. Examples and visuals are great, as are props (if appropriate). Handouts can be helpful to many, and can give you a place to put technical details or long-winded statements that you don't want to take the time to write down.

Everyone must practice their presentation in front of other students (not necessarily from Math 297) and get feedback from them. The presenter should keep track of this feedback and forward it to me afterwards. Afterwards, the presentor will practice it again for me in my office and get feedback from me. This will make your final presentation to the entire class much more polished than if it were your first time.

Since giving and receiving feedback is a skill that benefits from explicit teaching, here is a handout on feedback that everyone should read before giving (or receiving) a practice presentation.

Back to the Math 297 home page.

Back to my home page.