|
Size: 819
Comment:
|
Size: 3950
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| == REU == | == 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 |
| Line 5: | Line 10: |
| [http://www.math.washington.edu/~morrow/reu07/reu.html Jim Morrow's page]: Relevant papers. | === Talks === * All talks are posted on [http://www.math.washington.edu/~reu/papers/current/] === Schedule === * [:reu07/sched_archive:Archive Schedule] * Thursday, July 26 * 9:30: More Plexers (Andrew and Tracy) * 5:30 Laurelhurst salmon bake; details: http://www.seattle.gov/parks/centers/Laurelhurst/activity.htm * 7:05: Mariners game * Friday, July 27 * 9:30: James * 2:30: Anton Dochtermann on Topology of Graph Homomorphisms; Sieg 220 * July 27-29, Victoria trip? * Sunday, July 29, 2007 * 1:05 pm -- Mariners game * Friday, August 3 * 2:00 Friends and Enemies simulation === 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). 1. 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 1. Enhancing precision with exact linear algebra * Tom Boothby, Emily Kirkman 1. Combinatorics of Coxeter Groups (with Sara Billey) * Tom Boothby, 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, Emily Kirkman 1. New Algorithm for Finding Planar Embeddings with user-defined Topological Constraints * Emily Kirkman 1. [:Leon:Update] Jeffrey Leon's Partition Backtracking code * Tom Boothby, Robert Miller === Pictures === * [:emilyk:Emily Kirkman] |
| Line 7: | Line 59: |
| === Schedule === ==== Friday, June 20, 2007 ==== 2:00 pm -- Robert Miller: Introduction to SAGE === Projects === Tom Boothby, Robert Miller - [:Leon: update] Leon's code |
== 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 |
| Line 18: | Line 65: |
| To include a link: | |
| Line 19: | Line 67: |
| To include a link: | |
| Line 24: | Line 71: |
| To add a table of contents: | |
| Line 25: | Line 73: |
| To add a table of contents: | |
| Line 29: | Line 76: |
| To format the table of contents (simultaneously formatting the page): | |
| Line 30: | Line 78: |
| To format the table of contents: | |
| Line 39: | Line 86: |
| To create a new wiki page, simply navigate there, and you will be given a new blank page. | |
| Line 40: | Line 88: |
| 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$$ $\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]$$ 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. |
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]
- Thursday, July 26
- 9:30: More Plexers (Andrew and Tracy)
5:30 Laurelhurst salmon bake; details: http://www.seattle.gov/parks/centers/Laurelhurst/activity.htm
- 7:05: Mariners game
- Friday, July 27
- 9:30: James
- 2:30: Anton Dochtermann on Topology of Graph Homomorphisms; Sieg 220
- July 27-29, Victoria trip?
- Sunday, July 29, 2007
- 1:05 pm -- Mariners game
- Friday, August 3
- 2:00 Friends and Enemies simulation
Projects
- 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).
- Emily Kirkman
- 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)
- Tom Boothby, 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, Emily Kirkman
- New Algorithm for Finding Planar Embeddings with user-defined Topological Constraints
- Emily Kirkman
[: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
\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]
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.