Finite-pole conjecture for the Frobenius matrix
Finite-pole conjecture for the Frobenius matrix
The Frobenius matrix is the matrix arising from the Frobenius action in the recursive computation of the zeta function, with parameter . At infinity, a function has a pole of finite order if it is meromorphic there with a pole of bounded finite order, rather than having an essential singularity. Finite-pole conjecture. The Frobenius matrix has a pole of finite order at infinity, rather than an essential singularity. This conjecture would ensure that the Frobenius matrix has controlled behavior at infinity, supporting the effectiveness of the recursive method for computing zeta functions. The supplied text does not state whether the conjecture has been proved or disproved.
Sources & referencesView supporting material
Primary source
Alan G. B. Lauder, “A recursive method for computing zeta functions of varieties”, arXiv:math/0602352 (2006).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.