Greatest-common-divisor conjecture for zeta functions of \Upsilon-schemes
Statement
Let an -scheme be given, together with the collection of polynomials associated with its counting data. Greatest-common-divisor conjecture. The zeta function of an -scheme is the greatest common divisor of these polynomials. The source gives no further definition of the collection of polynomials or evidence that the conjecture has been resolved.
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.