Diff for "reu/07"

TableOfContents

REU Resources

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

• [http://www.math.washington.edu/~reu/ REU Archives]

• [http://www.math.washington.edu/~billey/classes/schubert.notes/notes.pdf Sara Billey's Schubert Variety notes]

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

Talks

• It would be really cool if we posted the in-progress papers distributed at the talks so far this summer. Jim, do you have copies?

Schedule

• [:reu07/sched_archive:Archive Schedule]
• Monday, July 15, 2007
  • 9:30 am -- Joe talk on Jordan curve theorem
  • 2:00 pm -- leave for Harry Potter movie
  • Evening -- Emily's girlfriend's band
• Tuesday, July 17, 2007
  • 9:30 am -- Computing the automorphism group of a graph, Robert Miller
  • Frisbee with SIMUW ?
• Wednesday, July 18, 2007
  • 1:30 -- 4:00 pm; Ernie Esser on Boomerangs (MGH 254)
  • 5:00 -- Pizza
  • 6:00 -- Picnic at Magnuson?
• Friday, Saturday, and Sunday, July 20-22, 2007
  • Victoria trip

  • Jeremy Enigk at the Chop Suey (21+). Doors open at 9 p.m. [http://www.ticketweb.com/user/?region=wa&query=schedule&venue=chopsuey1 Tickets.]

• Sunday, July 29, 2007
  • 1:00 pm -- Mariners game

Projects

1. Update Owen and Jeff's Genus Code.
   • Emily Kirkman

     • Use the current [http://sage.math.washington.edu:8500/genus_code version].

     • Inclusion of [http://pigale.sourceforge.net/ PIGALE] should lead to an improvement here as well (see below).

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 [http://www.cs.uvic.ca/~wendym/my_pubs/boyer.ps Algorithm]

       • [http://boost.sourceforge.net/ 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)
   • Tom Boothby, Sean Howe, Emily Kirkman, Robert Miller
   • [:reu07/bruhat_notes]
5. Dirichlet Problem for Directed Networks
   • Kari Christianson, Lindsay Erickson
6. Star-Ks and 2:1 Networks w/ Complex Admittance
   • Lindsay Erickson
7. Graphs and Connections on a Surface of Arbitrary Genus
   • Joe Mitchell
8. Angle Systems and Embeddings
   • Joey Greer, Emily Kirkman
9. New Algorithm for Finding Planar Embeddings with user-defined Topological Constraints
   • Emily Kirkman

10. [:Leon:Update] Jeffrey Leon's Partition Backtracking code

    • Tom Boothby, Robert Miller

Pictures

• [:emilyk:Emily Kirkman]

T-shirt Ideas

attachment:ninja_star.png

attachment:frisbee.png

http://sagemath.org:9001/days4/projects/redbull?action=AttachFile&do=get&target=dillhole.gif

http://sagemath.org:9001/days4/projects/redbull?action=AttachFile&do=get&target=ninja1.jpg

http://sagemath.org:9001/days4/projects/redbull?action=AttachFile&do=get&target=ninja3.jpg

http://images.salon.com/books/review/2005/01/12/lincoln/story.jpg

http://www.dvdverdict.com/images/reviewpics/sp82.jpg

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.