REU Main Page

Return to Archive

TALK SCHEDULE

• June 23: 9:30-noon, Jim; 1:30-3:00, Jim; 3:00 - ?, Matt
• June 24- June 27 9:30-noon; 1:30 - ?, Jim
• June 25-26: Jim
• June 27: Jim and Reid 9:30; Avi 1:30
• June 27: 5:00, Schultzy's 4114 University Way NE
• June 30: 9:30: Matthew, Matt, Jim; 2:00, Sara Billey
• July 1: 9:30: Courtney, brainstorm problems; 2:00, start work
• July 2: 10:30: Sara
• July 3: 9:30: David Ingerman
• July 7: 9:30: Jim on critical circular planar graphs; 11:00 William Stein on sage
• July 18: 5:00: Agua Verde
• July 21: 9:30: David Jekel
• July 22: 1:30: David J.
• July 23: 10:30: Emily, Austin, Carlos
• July 24: 1:30:David J.
• July 25: 9:30: David J.
• July 25: Gorditos
• July 28: 9:30 David J.
• July 29: 1:30 David J.
• July 30: 1:15 Ernie on boomerangs in Smith 404
• July 31: 5:00 am RAMROD; 1:30 pm: David J.
• August 4: 9:30 David J.
• Sometime this week Jerry Li will speak
  Problems

  Students

  Molly Baird
  UC Santa Cruz
  mcbaird@ucsc.edu

  Mark Bennett
  University of Washington
  mbennett718@gmail.com

  Carlos Coronado
  UT Pan American
  chcoronado@broncs.utpa.edu

  Matthew Fahrbach
  University of Kentucky
  matthew.fahrbach@uky.edu
  Properties of Peak Set Polynomials
  Peak Polynomials and Their Complex Roots
  Factoring Peak Polynomials

  Katherine Lacy
  Willamette
  klacy@willamette.edu

  Emily Myers
  Mary Baldwin College
  e.myers09@gmail.com

  Austin Tran
  University of Washington
  ant3.14159265@gmail.com
  7/2 notes

  Bryant Wong
  University of Washington
  bryantywong@gmail.com

  TAs (some informal)

  Reid Dale
  University of Washington
  reiddale@u.washington.edu
  o-minimality and n-1 graphs
  Model Theoretic Methods in Discrete Inverse Problems: o-minimality and n-to-1 Graphs in the Study of Electrical Networks

  David Jekel
  University of Washington
  davidjekel@gmail.com
  Annular Networks Preliminaries
  Removal of Type 1 Geodesics
  Radial Networks, Mixed Problems, and Connections
  The N-gon in N-gon Network Revisited
  A Recoverable Annular Network with Unrecoverable Dual
  Nonlinear Discrete Laplace and Heat Equations for Electrical Networks
  Network Drawings
  Topics in Signed and Nonlinear Electrical Networks

  Matt Junge
  University of Washington
  jungem@u.washington.edu
  website
  Recurrence and transience for the frog model on trees

  Courtney Kempton
  University of Washington
  cykempton@gmail.com
  n-1 graphs
  Courtney's thesis
  Courtney on n-to-1 graphs

  Avi Levy
  University of Washington
  avius@uw.edu
  REU Notes (also on my website)
  Results on permutation arrays:
  Semilinear PAs
  Contraction of PAs, I
  Contraction of PAs, II

  Nikolay Malkin
  University of Washington
  kolya_malkin@hotmail.com
  The Geodesic Integral on Medial Graphs

  Will Johnson

  
  University of California
  willij6@math.berkeley.edu
  Non-linear Electric Networks
  The Jacobian Determinant of the Conductivities-to-Response-Matrix Map for Well-Connected Critical Circular Planar Graphs
  Convexity and Dirchlet Problem for Directed Graphs -- the Dual Case
  Pseudoline Arrangements
  Circular Planar Networks with Nonlinear and Signed Conductors ArXiv paper.
  A Framework for the Addition of Knot-Type Combinatorial Games
  Recovery of Non-Linear Conductivities for Circular Planar Graphs
  Who Wins in "To Knot or Not to Knot" Played on Sums of Rational Shadows

  Faculty

  Sara Billey
  University of Washington
  billey@math.washington.edu
  Billey, Burdzy, and Sagan.
  Kasraoui.

  Jim Morrow
  University of Washington
  morrow@math.washington.edu
  Medial graph stuff
  Derivative of Lambda
  fortran computation of lambda
  fortran solution of inverse problem

  William Stein
  University of Washington
  wstein@gmail.com
  cloud.sagemath
  William Stein
  sage reu2013