TALK SCHEDULE

- June 19: Jim
- June 20-21: Jim
- June 22: Jim and Will
- June 23: Jim, Collin, and Thomas
- June 26: David and maybe Jim
- June 27: Brainstorm ideas
- June 28: Start working
- July 4: Holiday
- July 5: David on eigenvalues at 10:00
- July 6: David on eigenvalues at 10:00
- July 7: Natailie Frank on random walks on graphs and electrical resistance at 1:45
- July 10: David at 10:00
- July 11: Jim at 10:00
- July 12: Will at 10:00
- July 17: David at 1:45
- July 19: David at 1:45
- July 21: David at 1:45
- August 7: David and Will at 1:45
- August 8: Andrew at 10:30; Everett, Jasper, and Thomas at 1:45
- August 9: Matt and Michael at 10:30; Jasper at 1:45; Adrian at 2:45
- August 10: Tim at 10:30; Jasper and Monique at 1:45;
Natalie and Phoebe at 2:45

Problems from 2014

2016 problem list#### Students

Matthew Bertucci

LSU

mbertu3@lsu.eduAdrian Bolt

Iowa State

ajbolt@iastate.eduPhoebe Brawley

Stony Brook

phoebe.brawley@stonybrook.eduEverett Cheng

UW

eccheng@uw.eduMichael Dotzel

Missouri

md5xc@mail.missouri.edu

Chip Stacking

Trees on Circulant GraphsTimothy Guice

Auburn

twg0007@tigermail.auburn.eduNatalie Hollenbaugh

UW

hollen2@uw.eduJasper Hugunin

UW

jasperh@cs.washington.edu

Chip Firing on Trees

Generalizing Boundary Edges and Boundary Spikes to Larger Subgraphs, and other partial recoveryAndrew Krenz

Purdue

akrenz@purdue.eduMonique Roman

Iona

mroman1@gaels.iona.edu

Chip Firing on Trees#### TAs and References from recent TAs

Thomas Browning

University of Washington

thomas.l.browning@gmail.com

Doppelgangers: Revisiting Recurrences and the Ur-OperationWill Dana

University of Washington

danaw6@uw.edu

The Discrete Harmonic Cohomology Module on Networks

Critical Group of Cyclic Cayley GraphsCollin Litterell

University of Washington

collin.litterell@gmail.com

FROG MODEL WAKEUP TIME ON THE COMPLETE GRAPH

The Discrete Harmonic Cohomology Module on Networks

Sean Griffin (maybe)

University of Washington

griff.sean.t@gmail.comDavid 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 ALGEBRACourtney Kempton

University of Washington

cykempton@gmail.com

n-1 graphs

Courtney's thesis

Courtney on n-to-1 graphsAvi Levy (maybe)

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 ALGEBRANikolay Malkin

Yale University

kolya_malkin@hotmail.com

The Geodesic Integral on Medial GraphsWill 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

Jim Morrow

University of Washington

morrow@math.washington.edu

Medial graph stuff

Derivative of Lambda

fortran computation of lambda

fortran solution of inverse problem