2013/09/11 by Alman, Joshua, Lian, Carl, Tran, Brandon
#05A15 #05A16 #06A07 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1309.2697
Following de Verdière-Gitler-Vertigan and Curtis-Ingerman-Morrow, we prove a host of new results on circular planar electrical networks. We introduce a poset EPn of electrical networks with n boundary vertices, giving two equivalent characterizations, one combinatorial and the other topological. We then investigate various properties of the EPn, proving that it is graded by number of edges of critical representatives. Finally, we answer various enumerative questions related to EPn, adapting methods of Callan and Stein-Everett.