Walk enumeration conjecture for square non-zero recurrent configurations
Let be the relevant complete bipartite graph with one sink, let denote its recurrent configurations, and write for the heights at the non-sink vertices. Define
Square non-zero configuration conjecture. The cardinality satisfies
and this is also the number of walks from to that remain in the upper half-plane and use unit steps from .
The conjecture proposes a closed enumeration of square non-zero recurrent configurations and identifies the same numbers with constrained planar walks. The paper gives no proof or resolution beyond stating the conjecture.
References
- Mark Dukes and Yvan Le Borgne, “Parallelogram polyominoes, the sandpile model on a complete bipartite graph, and a q,t-Narayana polynomial”, arXiv:1208.0024 (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.