Related papers: Towards construction of superintegrable basis in m…
Many eigenvalue matrix models possess a peculiar basis of observables which have explicitly calculable averages. This explicit calculability is a stronger feature than ordinary integrability, just like the cases of quadratic and Coulomb…
We obtain in closed form averages of polynomials, taken over hermitian matrices with the Gaussian measure involved in the Kontsevich integral, and prove a conjecture of Witten enabling one to express analogous averages with the full (cubic…
We construct the ($\beta$-deformed) partition function hierarchies with $W$-representations. Based on the $W$-representations, we analyze the superintegrability property and derive their character expansions with respect to the Schur…
A brief review of the eigenvalue matrix model integrability and superintegrability properties, focused on the simplest, still representative, Gaussian Hermitian case.
We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…
We enumerate generalizations of the superintegrability property $<character>\ \sim {\rm character}$ and illuminate possible general structures behind them. We collect variations of original formulas available up to date and emphasize the…
The Hermite polynomials are ubiquitous but can be difficult to work with due to their unwieldy definition in terms of derivatives. To remedy this, we showcase an underappreciated Gaussian integral formula for the Hermite polynomials, which…
We analyze the well-known equivalence between the quadratic Kontsevich-Penner and Hermitian matrix models from the point of view of superintegrability relations, i.e. explicit formulas for character averages. This is not that trivial on the…
Some eigenvalue matrix models possess an interesting property: one can manifestly define the basis where all averages can be explicitly calculated. For example, in the Gaussian Hermitian and rectangular complex models, averages of the Schur…
Random matrix models based on an integral over supermatrices are proposed as a natural extension of bosonic matrix models. The subtle nature of superspace integration allows these models to have very different properties from the analogous…
We present a novel approach to Gaussian Berezin correlation functions. A formula well known in the literature expresses these quantities in terms of submatrices of the inverse matrix appearing in the Gaussian action. By using a recently…
We study the Hermitian supermatrix model involving an external source. We derive the determinantal formula for the supermatrix partition function, and also for the expectation value of the characteristic polynomial ratio, which yields the…
We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.
We design a new algorithm for solving parametric systems having finitely many complex solutions for generic values of the parameters. More precisely, let $f = (f_1, \ldots, f_m)\subset \mathbb{Q}[y][x]$ with $y = (y_1, \ldots, y_t)$ and $x…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
It is known that computing the permanent of the matrix $1+A$, where $A$ is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the boson-sampling proposal of restricted quantum computation, I…
We present a method to obtain higher order integrals and polynomial algebras for two-dimensional superintegrable systems from creation and annihilation operators. All potentials with a second and a third order integrals of motion separable…
We present an encoding of a polynomial system into vanishing and non-vanishing constraints on almost-principal minors of a symmetric, principally regular matrix, such that the solvability of the system over some field is equivalent to the…
Certifying the positivity of trigonometric polynomials is of first importance for design problems in discrete-time signal processing. It is well known from the Riesz-Fej\'ez spectral factorization theorem that any trigonometric univariate…