REU Main Page

Return to Archive

TALK SCHEDULE

• July 1: 9:30 Jim; 11:00 Ian; 1:30 Elliot (cancelled); 3:00 Hao
• July 2: 9:30 Jim; 11:00 Simon; 1:30 Sara; 3:00 Peter
• July 3: 9:30 Jim; 11:00 Elliot; 1:30 David
• July 5: 9:30 Jim; 11:00 Make problem list; begin work
• July 8: 9:30 Andrey
• July 9: 2:00 William
• July 10: 9:30 Andrey
• July 11: 9:30 Reid
• July 12: 9:30 Ian; 1:00 Justin, 135 Thomson
• July 16: 9:30 David
• July 17: 9:30 Andrey
• July 18: 9:30 Daniel
• July 19: 9:30 Andrey
• July 24: 9:30 Matthew
• July 25: 9:30 Daniel
• July 26: 9:30 T-shirts!
• July 29: 9:30 John
• July 30: 9:30 Jerry
• July 31: 9:30 Jim
• August 1: 9:30 Halley; 11:0 Dan Pollack on grad applications
• August 2: 9:30 Renford; 5:00 Pizza at Jim's
• August 5: 9:30 Daniel,Paul, and Trevor
• August 6: 9:30 Kolya; 1:30 Elliot's exam, Savery 158
• August 7: 9:30 Tom
• August 8: 10:00 Collin
• August 9: 9:30 Daniel; 11:00 Jackie Corbitt; noon Gordito's 213 N 85th St
• August 11: 2:30 potluck party at Magnuson
• August 12: 9:30 Chris; 11:00 Alan and Matthew
• August 13: 9:30 Halley and Michelle
• August 14: 9:30 Paul; 11:00 Daniel
• August 15: 10:00 Photo; David
• August 16: 10:00 review
  Problems

  Students

  Renford Alexander
  City University of New York
  alexander.renford@gmail.com

  Reid Dale
  University of Washington
  reiddale@u.washington.edu
  o-minimality and n-1 graphs

  Thomas Edwards
  University of Minnesota
  edwar535@umn.edu
  Dirichlet Convergence
  Discrete Laplacian of a Rectangular Grid

  Collin Erickson
  Vanderbilt University
  collin.b.erickson@live.vanderbilt.edu
  Voltage and Current Sources

  Matthew Fahrbach
  University of Kentucky
  matthew.fahrbach@uky.edu
  Properties of Peak Set Polynomials

  Chris Garnatz
  Pomona College
  cdgarnatz@gmail.com
  Finite Radon Transform

  Daniel Hirsbrunner
  University of Illinois
  hirsbru2@illinois.edu
  Elliptic Functions Notes
  Non Linear Annular 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

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

  Halley McCormick
  Whitman College
  mccormhp@whitman.edu
  3-1 Graphs
  Parametrization of n-wheeled graphs
  N-to-1 Graphs

  Michelle Randolph
  University of North Carolina, Ashville
  mrandolp@unca.edu
  3-1 Graphs
  N-to-1 Graphs

  Tevor Shumaker
  University of North Carolina, Ashville
  tshumake@unca.edu
  Non Linear Annular Networks

  Paul Scurek
  University of Wisconsin
  pmscurek@uwm.edu
  Non Linear Annular Networks

  Alan Talmage
  Washington University
  amtalmage@go.wustl.edu
  Properties of Peak Set Polynomials

  TAs

  Hao Chen
  University of Washington
  chenh123@math.washington.edu

  Jackie Corbitt
  University of Washington, Physics
  Bacteria that duel

  Peter Mannisto
  University of California, Berkeley
  mannisto@math.berkeley.edu
  The Connection-Determinant Formula
  The Tree-Diagram Formula
  Local Recoverability on Circular Planar Graphs
  (All joint with Owen Biesel)

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

  Jerry Li
  University of Washington
  jerryzli@u.washington.edu
  Uniqueness of Connections between Effectively Adjacent Circular Pairs
  Eigenstuff
  SDD solver

  Elliot Paquette
  University of Washington
  elliot.paquette@gmail.com
  references
  Doyle and Snell
  Lovasz
  Lyons
  Kirkpatrick's paper
  Gaussian free fields

  Konrad Schroder
  University of Washington
  perseant@hhhh.org
  Cut point lemma

  Simon Spicer
  University of Washington
  mlungu@math.washington.edu
  L-functions.

  Andrey Sarantsev
  University of Washington

  Justin Tittelfitz
  University of Washington
  jtittelf[AT]math[DOT]washington[DOT]edu
    My REU papers (2006):
  The Heat Equation on Discrete Domains
  Spectral Results for the Graph Laplacian
    My Research:
  Thermoacoustic Tomography in Elastic Media
    Other references:
  Notes on Calderon Problem (M. Salo)
  Numerical Work for Electrical Networks (A. Mamonov)
  Notes on Radon (X-ray) Transform (S. Helgason)
  Discrete Radon Transform (G. Beylkin)
  Reconstruction of missing data in social networks based on temporal patterns of interactions (A. Stomakhin et al.) (Log in to UW library to access this article through IOP)

  Ian Zemke
  University of Washington
  ianzemke@u.washington.edu
  Schroedinger Networks
  Infinite Networks
  Ian's thesis
  More on Infinite Networks

  John Zhang
  University of Washington
  jmzhang@u.washington.edu
  Parametrizing Response Matrices
  Medial Graphs and Y-Delta Equivalences

  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

  David Wilson
  david.wilson@microsoft.com
  Boundary partitions in trees and dimers
  The electrical response matrix of a regular 2n-gon
  Combinatorics of tripartite boundary connections for trees and dimers
  Double-dimer pairings and skew Young diagrams
  Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on Z2
  Inverse problem in cylindrical electrical networks by Thomas Lam and Pavlo Pylyavskyy