REU Main Page

Return to Archive

TALK SCHEDULE

• June 20: 9:30-noon, Jim; 1:30-3:30, Jim
• June 21: 9:30, John Jeng
• June 21-23: Jim
• June 23: 10:30?, Sam Hopkins
• June 24: Jim, Will, Collin, Sean
• June 27: 9:30, Jim; 10:30 Courtney's exam; 1:30, David
• June 28: 9:30, Jim; 10:30, Zach; 1:30, David; 3:00, Brainstorm problems
• June 29: 9:30 ,Will; Jim ; 1:30, David on Galois
• June 30: 10:30, Annie; 1:30, Courtney
• July 4: Holiday
• July 5: 10:30, David Ingerman; 1:30, David Jekel
• July 6: 10:30, Matt Junge
• July 7: 10:30, Will
• July 12: 10:30, Max, Thomas, Zander
• July 14: 3:30, Avi
• July 17: 10:30, Will
• July 21: 10:30, Austin
• July 25: 10:30, Molly Baird
• July 28: 10:30, John Palmieri
• August 3: 2:30, Kevin Zatloukal
• August 8: 10:30, Max, Thomas, Zander
• August 10: 10:30, Christine and Melanie; 2:30, Merrill
• August 11: 10:30, Zander; 1:30, Brittany, Chris, Jennifer; 2:30, Eion, Esther
  Problems from 2014
  2016 problem list

  Students

  Eion Blanchard
  University of Florida
  blanchardeion@ufl.edu
  Extreme Genera and Other Techniques of Graph Embeddings
  

  Thomas Browning
  University of Washington
  thomas.l.browning@gmail.com
  Building and Classifying Doppelgangers of Unlabeled Posets

  Brittany Dygert
  Seattle Pacific University
  bddygert@gmail.com
  FROG MODEL WAKEUP TIME ON THE COMPLETE GRAPH
  The Bullet Problem with Discrete Speeds

  Melanie Ferreri
  ferrmj15@wfu.edu
  Solving the Inverse Problem Through Optimization Methods
  

  Max Hopkins
  Harvard University
  nhopkins@college.harvard.edu
  Building and Classifying Doppelgangers of Unlabeled Posets
  

  Esther Hunt
  George Fox University
  ehunt13@georgefox.edu
  Extreme Genera and Other Techniques of Graph Embeddings
  

  Zander Kelley
  Texas A&M
  zander_k@tamu
  Building and Classifying Doppelgangers of Unlabeled Posets

  Christoph Kinzel
  University of Oklahoma
  christoph.c.kinzel-1@ou.edu
  The Bullet Problem with Discrete Speeds

  Merrill Warnick
  Brigham Young University
  merrill.warnick@gmail.com
  The Orb Graph

  Christine Wolf
  University of Washington
  cewolf11@msn.com
  Solving the Inverse Problem Through Optimization Methods

  Jennifer Zhu
  University of California, Berkeley
  jzhu42@gmail.com
  The Bullet Problem with Discrete Speeds
  

  TAs and References

  Will Dana
  University of Washington
  danaw6@uw.edu
  The Discrete Harmonic Cohomology Module on Networks

  Collin Litterell
  University of Washington
  collin.litterell@gmail.com
  FROG MODEL WAKEUP TIME ON THE COMPLETE GRAPH
  The Discrete Harmonic Cohomology Module on Networks

  Austin Stromme
  University of Washington
  austinjstromme@gmail.com
  FROG MODEL WAKEUP TIME ON THE COMPLETE GRAPH
  The Discrete Harmonic Cohomology Module on Networks

  
  Sean Griffin
  University of Washington
  griff.sean.t@gmail.com

  Reid Dale
  University of California, Berkeley
  reidrgdale@gmail.com
  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
  UCLA
  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
  Layering Graphs with Boundary and Networks
  Layering ∂-Graphs and Networks:
  TORSION OF THE GRAPH LAPLACIAN: SANDPILES, ELECTRICAL NETWORKS, AND HOMOLOGICAL ALGEBRA

  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
  Degeneracy in the Discrete Inverse Problem
  TORSION OF THE GRAPH LAPLACIAN: SANDPILES, ELECTRICAL NETWORKS, AND HOMOLOGICAL ALGEBRA

  Nikolay Malkin
  Yale University
  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

  Zachary Hamaker
  University of Washington (visiting)
  zachary.hamaker@gmail.com
  

  Sara Billey
  University of Washington
  billey@math.washington.edu

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

  Annie Raymond
  University of Washington
  annieraymond@gmail.com

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