One can give a formal argument for the conjecture in the spirit of the proof of the strong Szegő limit theorem given by Bump and Diaconis [1].
Statement
One can give a formal argument for the conjecture in the spirit of the proof of the strong Szegő limit theorem given by Bump and Diaconis [1]. The formal argument can be made rigorous if the following weaker conjecture holds: Conjecture 12. For each 0 \leq r < 1 and each integer k \geq 1, there is a constant C = C(r, k) such that for all d-tuples of k \times k matrices A = (A1 , . . . , Ad ) satisfying kAkrow \leq r, we have Z (13) sup | det(I − A ⊗ U )|2 dU d \leq C(r, k). N U (N )d Conjecture 10. Let p and q be polynomials in non-commuting indeterminates x1 , . . . , xd with p(0) = q(0) = 1, and suppose p and q are stable with determinantal representations det p(X) = det(I − A ⊗ X), det q(X) = det(I − B ⊗ X). Then Z (11) lim det(p(U ))det q(U ) dU d = det((I − A ⊗ B)−1 ). N \to\infty U (N )d From above, the conjecture holds for all d when k = 1 and for all k when d = 1. 2 It is plausible that C(r, k) = (1 − r2 )−k should work and that the integrals in (13) should increase monotonically with N , but we have not been able to prove this. (Both are true when k = 1.)
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.