Related papers: The Matrix Ansatz, Orthogonal Polynomials, and Per…
This paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. We propose a unified hierarchy of Moment-SOS relaxations to solve it globally. Under some assumptions, we prove…
Accretive partial transpose (APT) matrices have been recently defined, as a natural extension of positive partial transpose (PPT) matrices. In this paper, we discuss further properties of APT matrices in a way that extends some of those…
We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework…
We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the…
The use of complex networks as a modern approach to understanding the world and its dynamics is well-established in literature. The adjacency matrix, which provides a one-to-one representation of a complex network, can also yield several…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
Some idea, which leads to a non-trivial solution of the quantum four-simplex equation, is exposed in this paper. We call this idea "pentagonal algebra". Few examples of the realisation of this idea are given here, and thus few examples of…
We establish new explicit connections between classical (scalar) and matrix Gegenbauer polynomials, which result in new symmetries of the latter and further give access to several properties that have been out of reach before: generating…
We define tensors, corresponding to cubic polynomials, which have the same exponent $\omega$ as the matrix multiplication tensor. In particular, we study the symmetrized matrix multiplication tensor $sM_n$ defined on an $n\times n$ matrix…
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…
We examine the asymptotics of the moments of characteristic polynomials of $N\times N$ matrices drawn from the Hermitian ensembles of Random Matrix Theory, in the limit as $N\to\infty$. We focus in particular on the Gaussian Unitary…
An effective method to obtain exact analytical solutions of equations describing the coherent dynamics of multilevel systems is presented. The method is based on the usage of orthogonal polynomials, integral transforms and their discrete…
Assortment optimization refers to the problem of designing a slate of products to offer potential customers, such as stocking the shelves in a convenience store. The price of each product is fixed in advance, and a probabilistic choice…
In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…
This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…
This document presents a combinatorial framework for analyzing assembly systems using generating functions. We explore the theory through concrete examples, such as linear polymers, and develop recursive equations to characterize valid…
This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have…
This paper studies the complexity of matrix Putinar's Positivstellens{\"a}tz on the semialgebraic set that is given by the polynomial matrix inequality. \rev{When the quadratic module generated by the constrained polynomial matrix is…
This chapter is an introduction to the connection between random matrices and maps, i.e graphs drawn on surfaces. We concentrate on the one-matrix model and explain how it encodes and allows to solve a map enumeration problem.