On the proof of universality for orthogonal and symplectic ensembles in random matrix theory (Q2473341)

In a previous paper, \textit{P. Deift} and \textit{D. Gioev} [IMRP, Int. Math. Res. Pap. 2007, Article ID rpm004 (2007; Zbl 1136.82021)] have proved that a certain matrix \(T^{[m-1]}\) verifies the relation \(\det T^{[m-1]}\neq0\) for \(m\geq2\). This relation plays a crucial role in proving universality in the bulk and at the edge for orthogonal and symplectic random matrix ensembles (i.e. the cases \(\beta=1\) and \(\beta=4\) respectively) which was studied by Deift and Gioev [loc. cit.]. In this paper the following quantitative version of this relation is given: \(\det T^{[m-1]}\geq0.0865\). This result provides new informations on the asymptotics of the \(\beta=1\) and \(\beta=4\) partition functions for log gases.