The identification of the extended refined open partition function and the Kontsevich-Penner matrix model

TL;DR

This paper connects the extended refined open partition function with the Kontsevich-Penner matrix model, providing a new simple form and confirming their equivalence under certain parametrizations.

Contribution

It introduces a new matrix model for the extended refined open partition function and proves its equivalence to the Kontsevich-Penner matrix model.

Findings

Derived a simplified form of the open partition function matrix model.

Established the equivalence between the extended refined open partition model and the Kontsevich-Penner model.

Confirmed the models' identification for all N ≥ 1.

Abstract

The open intersection theory has been initiated by R. Pandharipande, J. P. Solomon and R. J. Tessler. In the scope of matrix model theory, A. Buryak and R. J. Tessler have constructed a matrix model $\mathcal{Z}^o$ for the open partition function based on a Kontsevich type combinatorial formula for the open intersection numbers found by R. J. Tessler. In this paper, using the Harish-Chandra-Itzykson-Zuber formula and operational calculus, we transform $\mathcal{Z}^o$ into another simple form, and define the matrix model $\mathcal{Z}_N^{o,ext,s}$ for the extended refined open partition function from it. The expression of $\mathcal{Z}_N^{o,ext,s}$ will immediately lead us to the Kontsevich-Penner matrix model $Z_N$ under the Miwa parametrization $s_i=2^ii!\operatorname{tr} \Lambda^{-2i-2}$. Hence it confirms the identification between the two models for general $N\geq 1$.