TALK SCHEDULE
Nikki Carter
University of Portland
cartern16@up.edu
Evan Castle
University of Kentucky
evanscastle@gmail.com
Carlos Coronado
UT Pan American
chcoronado@broncs.utpa.edu
Will Dana
University of Washington
danaw6@uw.edu
Weinberg Dictionary
Brittany Dygert
Seattle Pacific University
bddygert@gmail.com
Natalie Frank
University of Washington
natalief@uw.edu
Stephen Lacina
University of Oklahoma
stephen.d.lacina-1@ou.edu
Collin Litterell
University of Washington
collin.litterell@gmail.com
Meredith Shea
Case Western Reserve University
mas389@case.edu
Austin Stromme
University of Washington
austinjstromme@gmail.com
Andrew You
Duke University
andrew.kh.you@gmail.com
Nick Reichert's talk
Kolya's and Avi's talks
Kyle Curlett
Uniersity of Washington
kyle.curlett@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
University of Washington
davidjekel@gmail.com
The N-gon in N-gon Network Revisited
Annular_Plate_Networks
Nonlinear Discrete Laplace and Heat Equations for Electrical Networks
Network_Drawings_2.tex
Network Drawings
Topics in Signed and Nonlinear Electrical Networks
Information Propagation
Layering Graphs-with-Boundary and 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
Degeneracy in the Discrete Inverse Problem
Nikolay Malkin
University of Washington
kolya_malkin@hotmail.com
The Geodesic Integral on Medial Graphs
Jacob Richey
University of Washington
jfrichey@math.washington.edu
Counting Clusters on a Finite Grid
Jair Taylor
University of Washington
jptaylor@math.washington.edu
Acyclic Orientatation of Graphs by Richard
Stanley.
Chromatic Symmetric Functions of Hypertrees
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
Sara Billey
University of Washington
billey@math.washington.edu
Sara Billey homepage
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
electrical matroids
Duffin
Bruno-Weinberg I
Bruno-Weinberg II
More on Infinite Networks by Ian Zemke.
Annie Raymond
University of Washington
annieraymond@gmail.com
William Stein
University of Washington
wstein@gmail.com
cloud.sagemath
William Stein
sage reu2013
David Wilson
david.wilson@microsoft.com
David Wilson's homepage
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