Related papers: A Matrix Model with BMS$_3$ Constraints
In this paper, we show how to get matrix models corresponding to the refined BPS states partition functions of $\mathbb{C}^3$, resolved conifold and $\mathbb{C}^3/\mathbb{Z}_2$ by inserting the identity operator at a proper position in the…
The Virasoro constraints play the important role in the study of matrix models and in understanding of the relation between matrix models and CFTs. Recently the localization calculations in supersymmetric gauge theories produced new…
In this paper, we elaborate on aspects of the recently introduced BMS bootstrap programme. We consider two-dimensional (2d) field theories with BMS3 symmetry and extensively use highest weight representations to uncover the BMS version of…
A fundamental problem in numerical analysis and approximation theory is approximating smooth functions by polynomials. A much harder version under recent consideration is to enforce bounds constraints on the approximating polynomial. In…
One loop corrections to the neutrino mass matrix within the MSSM with Bilinear R Parity Violation are calculated, paying attention to the approach in which an effective $3\times 3$ neutrino mass matrix is used. The full mass matrix is block…
Matrix equations are omnipresent in (numerical) linear algebra and systems theory. Especially in model order reduction (MOR) they play a key role in many balancing based reduction methods for linear dynamical systems. When these systems…
An elimination problem in semidefinite programming is solved by means of tensor algebra. It concerns families of matrix cube problems whose constraints are the minimum and maximum eigenvalue function on an affine space of symmetric…
We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining…
We explore the consequences of assuming that the neutrino mass matrix is a linear combination of the matrices of a three dimensional representation of the group $S_3$ and that it has one zero mass eigenvalue. When implemented, these two…
We consider the problem of matrix completion on an $n \times m$ matrix. We introduce the problem of Interpretable Matrix Completion that aims to provide meaningful insights for the low-rank matrix using side information. We show that the…
We propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to…
The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…
We derive an explicit formula for a restricted partition function P_n^m(s) with constraints making use of known expression for a restricted partition function W_m(s) without constraints
We present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the…
This document presents a series of open questions arising in matrix computations, i.e., the numerical solution of linear algebra problems. It is a result of working groups at the workshop Linear Systems and Eigenvalue Problems, which was…
This work has introduced a generalized formulation of the problem of eigenvalue spectrum assignment for block matrix systems. In this problem, it is required to construct a feedback that provides that the matrix of the closed-loop system is…
We propose an algorithm for low rank matrix completion for matrices with binary entries which obtains explicit binary factors. Our algorithm, which we call TBMC (\emph{Tiling for Binary Matrix Completion}), gives interpretable output in the…
The goal of Boolean Matrix Factorization (BMF) is to approximate a given binary matrix as the product of two low-rank binary factor matrices, where the product of the factor matrices is computed under the Boolean algebra. While the problem…
Partition functions of eigenvalue matrix models possess a number of very different descriptions: as matrix integrals, as solutions to linear and non-linear equations, as tau-functions of integrable hierarchies and as special-geometry…
We extend the BFSS matrix theory by means of Lie 3-algebra. The extended model possesses the same supersymmetry as the original BFSS matrix theory, and thus as the infinite momentum frame limit of M-theory. We study dynamics of the model by…