Size: 3772
Comment:
|
Size: 3822
Comment:
|
Deletions are marked like this. | Additions are marked like this. |
Line 35: | Line 35: |
* 9:30 am -- maybe Jim on medial graphs | * 9:30 am -- David |
Line 38: | Line 38: |
* Barbeque at Peter's house | * 3:00 -- Barbeque at Peter's house * Monday, July 1, 2007 * 9:30 am -- Jim on medial graphs |
REU
[http://www.math.washington.edu/~morrow/reu07/reu.html Jim Morrow's page]: Relevant papers.
[http://www.math.washington.edu/~reu/ REU Archives]
Schedule
- 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
- Ideas here:
- 12:45 pm -- Zome Tools
- 10:00 am -- Brainstorming to come up with problems and other activities.
- 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
- 5:00 pm -- Dinner?
- Saturday, June 30, 2007
- 3:00 -- Barbeque at Peter's house
- Monday, July 1, 2007
- 9:30 am -- Jim on medial graphs
Projects
[:Leon:Update] Jeffrey Leon's Partition Backtracking code
- Tom Boothby, Robert Miller
- 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 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).
- Enhancing precision with exact linear algebra
- Tom Boothby, Emily Kirkman
- Combinatorics of Coxeter Groups (with Sara Billey)
- Tom Boothby, Kari Christianson, Emily Kirkman, Robert Miller
Pictures
- [:emilyk:Emily Kirkman]
Resources
Dive into Python: http://www.diveintopython.org/
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:
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