Differences between revisions 29 and 30
Revision 29 as of 2007-06-27 22:54:26
Size: 3303
Editor: anonymous
Comment:
Revision 30 as of 2007-06-27 22:55:24
Size: 3368
Editor: anonymous
Comment:
Deletions are marked like this. Additions are marked like this.
Line 47: Line 47:
  * Status: Linear time achievable by modifying input to Boyer and Myrvold algorithm. (Not reinventing the wheel, just sticking one in the graph).   * Status: Linear time achievable by modifying input to Boyer and Myrvold algorithm. (Not reinventing the wheel, just sticking one in the graph).  Currently working on including PIGALE's tgraph library in SAGE.

TableOfContents

REU

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
    • 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 -- maybe Jim on medial graphs
    • 5:00 pm -- Dinner?
  • Saturday, June 30, 2007
    • Barbeque at Peter's house

Projects

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

    • Tom Boothby, Robert Miller
  2. Update Owen and Jeff's Genus Code.
    • Emily Kirkman
  3. Algorithm to test for circular planarity
    • Emily Kirkman
    • Status: Linear time achievable by modifying input to Boyer and Myrvold algorithm. (Not reinventing the wheel, just sticking one in the graph). Currently working on including PIGALE's tgraph library in SAGE.
    • Resources:
  4. Enhancing precision with exact linear algebra
    • Tom Boothby, Emily Kirkman
  5. Combinatorics of Coxeter Groups (with Sara Billey)
    • Tom Boothby, Kari Christianson, Emily Kirkman, Robert Miller

Pictures

  • [:emilyk:Emily Kirkman]

Resources

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.

reu/07 (last edited 2019-11-23 17:22:22 by chapoton)