reu/07

REU Resources

• Jim Morrow's page: Relevant papers.

• REU Archives

• Sara Billey's Schubert Variety notes

• Dive into Python: https://www.diveintopython.org/

• Python Library reference: https://www.python.org/doc/current/lib/lib.html

Talks

• All talks are posted on http://www.math.washington.edu/~reu/papers/current/

Schedule

• Archive Schedule

• Tuesday, August 7
  • 9:30 am: Joey
• Wednesday, August 8
  • 9:30 am: Sean and Emily
  • 10:45 am: Kari and Lindsay
  • 2:00 - 2:20pm: Friends and Enemies Simulation
  • 6:00 pm: Gorditos, 213 N 85th St
• Thursday, August 9
  • 9:30 am: Tracy, Tom, Andrew
  • 10:30 am: Joe and Jaime
  • 11:30 am: Nate and James
  • 1:00 pm: Photo at the Troll
• Friday, August 10
  • Review

Projects

1. Update Nick's Genus Code.
   • Emily Kirkman, Robert Miller

     • The current version is implemented in SAGE 2.7.1 (available at https://sage.math.washington.edu:8600 )

     • Backtracking should lead to a significant improvement. (This will probably be hacked at after the REU is over, but you guys should check back because it will be awesome).
2. Algorithm to test for recoverability
   • Emily Kirkman
   • Circular Planarity Testing:
     • Status: Linear time achievable by modifying the graph before calling an O(n) planar embedding (testing) algorithm. (Not reinventing the wheel, just sticking one in the graph). Currently working on including the Boost library in SAGE.
     • Resources:

       • A simple O(n) Planarity Testing Algorithm

       • Boost implementation of the algorithm.

   • Criticality
3. Enhancing precision with exact linear algebra
   • Tom Boothby, Emily Kirkman
4. Combinatorics of Coxeter Groups (with Sara Billey)
   • Sean Howe, Emily Kirkman, Robert Miller

   • reu07/bruhat_notes

5. Dirichlet Problem for Directed Networks
   • Kari Christianson, Lindsay Erickson
6. Complexers
   • Lindsay Erickson
7. Graphs and Connections on a Surface of Arbitrary Genus
   • Joe Mitchell
8. Angle Systems and Embeddings
   • Joey Greer
9. New Algorithm for Finding Planar Embeddings with user-defined Topological Constraints
   • Emily Kirkman - This will also come after inclusion of Boost. (see above)

10. Update Jeffrey Leon's Partition Backtracking code

    • Tom Boothby, Robert Miller

Pictures

• Emily Kirkman

T-shirt Decision

• Crab full size on back
• Owen'ed full size on front, UW Math REU 2007 Jaime-style on top / bottom
• Blue shirts with yellow text

Wiki examples

To include a link:

[http://www.math.washington.edu/~morrow/reu07/reu.html Jim Morrow's page]
[:Leon: update]

To add a table of contents:

[[TableOfContents]]

To format the table of contents (simultaneously formatting the page):

== Top Level, No. 1 ==
== Top Level, No. 2 ==
=== Next Level, No. 1 ===
=== Next Level, No. 2 ===
==== Another Level, etc. ====
== Top Level, No. 3 ==

To create a new wiki page, simply navigate there, and you will be given a new blank page.

MoinMoin, this particular brand of wiki, also allows you to use LaTeX:

\sum_{k=1}^n{n \choose k}x^k

Here's how to do that:

$$\sum_{k=1}^n{n \choose k}x^k$$
$\sum_{k=1}^n{n \choose k}x^k$
$$\left[\begin{array}{cccc}1 & 0 & 0 & 0 \\0 & 1 & 0 & 0 \\0 & 0 & 0 & \omega \\0 & 0 & -\omega & 0\end{array}\right]$$

NOTE: The double-dollar notation is a replacement for LaTeX's math environment \[...\], which does not work in the wiki.