ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let OO be the origin in Z2\mathbb Z^2, and let ana_n be the number of self-avoiding walks from OO to OO of length nn. A Wilfian formula of type (W1) is an algorithm computing ana_n in time polynomial in nn.

Self-avoiding-walk Wilfian conjecture. The sequence ana_n 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.