Conditional local moves on polygonal networks for every n

Let Πn\Pi_n denote the polygonal resistor network used in the paper, and let a conditional local move be a local transformation of a subgraph of Πn\Pi_n. Boundary edges and boundary spikes refer to the corresponding outer-boundary features; the outermost layer and outermost partial layer are the layers specified by the construction of Πn\Pi_n.

Conditional local-move existence conjecture. For every integer n3n\geq 3, there exists a conditional local move on Πn\Pi_n such that:

{n3(mod4):a boundary edge from the outermost layer is changed into a boundary spike on the opposite side;n0(mod4):a boundary spike from the outermost partial layer is changed into a boundary spike on the opposite side;n1(mod4):a boundary spike from the outermost partial layer is changed into a boundary edge on the opposite side;n2(mod4):a boundary edge from the outermost partial layer is changed into a boundary edge on the opposite side.\begin{cases} n\equiv 3\pmod 4: & \text{a boundary edge from the outermost layer is changed into a boundary spike on the opposite side};\\ n\equiv 0\pmod 4: & \text{a boundary spike from the outermost partial layer is changed into a boundary spike on the opposite side};\\ n\equiv 1\pmod 4: & \text{a boundary spike from the outermost partial layer is changed into a boundary edge on the opposite side};\\ n\equiv 2\pmod 4: & \text{a boundary edge from the outermost partial layer is changed into a boundary edge on the opposite side}. \end{cases}

The conjecture extends the conditional local moves listed earlier and suggests a combinatorial interpretation of their formulas in terms of groves or a grove-like structure. The source gives no proof of existence for all nn, so the conjecture remains open.

Sources & referencesView supporting material

Primary source

Yulia Alexandr, Brian Burks, Sunita Chepuri and Patricia Commins, “Recovering Conductances of Resistor Networks in a Punctured Disk”, arXiv:1812.01517 (2018).

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.