3867
Comment:
|
4020
|
Deletions are marked like this. | Additions are marked like this. |
Line 3: | Line 3: |
== REU == | == REU Resources == |
Line 6: | Line 6: |
* [http://www.math.washington.edu/~billey/classes/schubert.notes/notes.pdf Sara Billey's Schubert Variety notes] * Dive into Python: http://www.diveintopython.org/ * Python Library reference: http://www.python.org/doc/current/lib/lib.html |
|
Line 7: | Line 10: |
=== Talks === * All talks are posted on [http://www.math.washington.edu/~reu/papers/current/] |
|
Line 9: | Line 13: |
* Friday, June 22, 2007 * 9:30 am -- Jim's Lecture * 2:00 pm -- Robert Miller: Introduction to SAGE. * 5:30 pm -- Agua Verde * Saturday, June 23, 2007 * 10:30 -- PDL loading dock: Math n' Stuff Store * Sunday, June 24, 2007 * 10:30 -- PDL loading dock: Aquarium * Monday, June 25, 2007 (Jim will be missing) * 10:00 am -- Brainstorming to come up with problems and other activities. * Ideas here: * brainstorm ideas * 12:45 pm -- Zome Tools * Tuesday, June 26, 2007 * 9:30 am -- Peter lecture * Noon -- Rock Climbing (Tom Boothby) * First individual meetings * Wednesday, June 27, 2007 * 9:30 am -- Sara Billey * 10:45 am -- Owen, Emily * 2-4:30 pm -- individual meetings * 5:00 pm -- Pizza, Mary Gates Hall, room 254 * Thursday, June 28, 2007 * 9:30 am -- Peter on star-K * 10:45 am -- Jim on critical circular planar graphs * Friday, June 29, 2007 * 9:30 am -- David * Saturday, June 30, 2007 * 3:00 pm -- Barbeque at Peter's house; meet at PDL loading dock * Monday, July 2, 2007 * 9:30 am -- Jim on medial graphs * Sometime July 2-6: Jaime and Robert |
* [:reu07/sched_archive: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 |
Line 43: | Line 29: |
0. [:Leon:Update] Jeffrey Leon's Partition Backtracking code * Tom Boothby, Robert Miller 1. Update Owen and Jeff's Genus Code. |
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). 1. Algorithm to test for recoverability |
Line 47: | Line 35: |
* 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). 1. Algorithm to test for circular planarity * Emily Kirkman * 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 PIGALE's tgraph library in SAGE. * Resources: * A simple O(n) Planarity Testing [http://www.cs.uvic.ca/~wendym/my_pubs/boyer.ps Algorithm] * [http://pigale.sourceforge.net/ PIGALE] implementation of the algorithm. (See also: [http://en.wikipedia.org/wiki/Fraysseix-Rosenstiehl%27s_planarity_criterion wikipedia] page describing Fraysseix-Rosenstiehl planarity criterion). |
* 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 |
Line 58: | Line 44: |
* Tom Boothby, Kari Christianson, Emily Kirkman, Robert Miller | * Sean Howe, Emily Kirkman, Robert Miller * [:reu07/bruhat_notes] 1. Dirichlet Problem for Directed Networks * Kari Christianson, Lindsay Erickson 1. Complexers * Lindsay Erickson 1. Graphs and Connections on a Surface of Arbitrary Genus * Joe Mitchell 1. Angle Systems and Embeddings * Joey Greer 1. New Algorithm for Finding Planar Embeddings with user-defined Topological Constraints * Emily Kirkman - This will also come after inclusion of Boost. (see above) 1. [:Leon:Update] Jeffrey Leon's Partition Backtracking code * Tom Boothby, Robert Miller |
Line 61: | Line 60: |
=== Resources === * Dive into Python: http://www.diveintopython.org/ |
== 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 |
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/
Python Library reference: http://www.python.org/doc/current/lib/lib.html
Talks
All talks are posted on [http://www.math.washington.edu/~reu/papers/current/]
Schedule
- [:reu07/sched_archive: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
- 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).
- Emily Kirkman, Robert Miller
- 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
- Enhancing precision with exact linear algebra
- Tom Boothby, Emily Kirkman
- Combinatorics of Coxeter Groups (with Sara Billey)
- Sean Howe, Emily Kirkman, Robert Miller
- [:reu07/bruhat_notes]
- Dirichlet Problem for Directed Networks
- Kari Christianson, Lindsay Erickson
- Complexers
- Lindsay Erickson
- Graphs and Connections on a Surface of Arbitrary Genus
- Joe Mitchell
- Angle Systems and Embeddings
- Joey Greer
- New Algorithm for Finding Planar Embeddings with user-defined Topological Constraints
- Emily Kirkman - This will also come after inclusion of Boost. (see above)
[:Leon:Update] Jeffrey Leon's Partition Backtracking code
- Tom Boothby, Robert Miller
Pictures
- [:emilyk: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.