The Galashin-Lam comparison and a q=1 obstruction
Statement
To a quiver, we can associate a point count polynomial defined recursively (Galashin-Lam). This is sometimes equal to the HOMFLY-PT polynomial of the related link. For any simple plabic graphs, are these polynomials always equivalent?
Record
- Source
- Added
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.