Persistence exponent conjecture for fixed-size truncations of random orthogonal matrices

From papers

Let \ell be a fixed integer, and let M2nM_{2n} be the ensemble of random matrices defined in Theorem 1. The corresponding persistence probability is denoted by p2n()p_{2n}^{(\ell)}. Define

θ()=12π0log(1Γ(2+ix)Γ(2)2)dx.\theta(\ell)=-\frac{1}{2\pi}\int_0^\infty\log\left(1-\left|\frac{\Gamma\left(\frac{\ell}{2}+ix\right)}{\Gamma\left(\frac{\ell}{2}\right)}\right|^2\right)\,\mathrm{d}x.

Persistence exponent conjecture. The persistence probability satisfies

limnlogp2n()logn=2θ().\lim_{n\to\infty}\frac{\log p_{2n}^{(\ell)}}{\log n}=-2\theta(\ell).

For =1\ell=1 this asymptotic behavior is established in the paper, while the conjecture extends the persistence-exponent formula to every fixed integer >1\ell>1.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Martin Gebert and Mihail Poplavskyi, “On pure complex spectrum for truncations of random orthogonal matrices and Kac polynomials”, arXiv:1905.03154 (2019).

Solutions 0

No solutions have been posted yet.