The lexicographic shellability conjecture for the electrical poset

Let EPnEP_n be the graded poset of electrical networks on nn boundary vertices, with rank given by the number of edges in a critical representative. Lexicographic shellability conjecture. EPnEP_n is lexicographically shellable, and hence Cohen–Macaulay, spherical, and Eulerian. This would give strong topological information about the order complex of EPnEP_n. The text reports verification of the Eulerian property for n7n\leq 7, agreement of homology with a sphere for n4n\leq 4, and no known LL-labeling for n4n\geq 4; the general conjecture remains open.

Sources & referencesView supporting material

Primary source

Joshua Alman, Carl Lian and Brandon Tran, “Circular Planar Electrical Networks I: The Electrical Poset EP_n”, arXiv:1309.2697 (2013).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.