Wilfian-formula conjecture for self-avoiding walks
Statement
Let be the origin in , and let be the number of self-avoiding walks from to of length . A Wilfian formula of type (W1) is an algorithm computing in time polynomial in .
Self-avoiding-walk Wilfian conjecture. The sequence has no Wilfian formula of type (W1).
The conjecture concerns a natural walk-counting sequence in a graph whose growth makes direct dynamic programming ineffective. The supplied text gives no evidence of resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.