Related papers: Orthogonal Laurent polynomials on the unit circle …
In this survey paper we study parametric versions of writing a matrix in $SL_n (\mathbb{C})$ as a product of lower and upper unitriangular matrices in interchanging order as well as generalizations to other classical groups. We give an…
Matrix orthogonal Laurent polynomials in the unit circle and the theory of Toda-like integrable systems are connected using the Gauss--Borel factorization of two, left and a right, Cantero-Morales-Velazquez block moment matrices, which are…
We present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix. That is, the algorithm computes a factorization $\mathbf{P}^T\mathbf{A}\mathbf{P} =…
Macdonald polynomials are orthogonal polynomials associated to root systems, and in the type A case, the symmetric kind is a common generalization of Schur functions, Macdonald spherical functions, and Jack polynomials. We use the…
We study the problem of decomposition (non-commutative factorization) of linear ordinary differential operators near an irregular singular point. The solution (given in terms of the Newton diagram and the respective characteristic numbers)…
Snake graphs are a class of planar graphs that are important in the theory of cluster algebras. Indeed, the Laurent expansions of the cluster variables in cluster algebras from surfaces are given as weight generating functions for 1-dimer…
In this paper we study matrix valued orthogonal polynomials of one variable associated with a compact connected Gelfand pair (G,K) of rank one, as a generalization of earlier work by Koornwinder and subsequently by Koelink, van Pruijssen…
Consider the symmetric group $S_n$ acting as a reflection group on the polynomial ring $k[x_1, \ldots, x_n]$, where $k$ is a field such that Char$(k)$ does not divide $n!$. We use Higher Specht polynomials to construct matrix factorizations…
In a classical case, orthogonal polynomial sequences are in such a way that the $ n $th polynomial has the exact degree $n$. Such sequences are complete and form a basis of the space for any arbitrary polynomial. In this paper, we introduce…
Vector-valued Jack polynomials associated to the symmetric group ${\mathfrak S}_N$ are polynomials with multiplicities in an irreducible module of ${\mathfrak S}_N$ and which are simultaneous eigenfunctions of the Cherednik-Dunkl operators…
Orthogonality relations for Foulkes characters of full monomial groups are presented, along with three solutions to the problem of decomposing products of these characters, and new applications, including a product reformulation of a Markov…
In this paper we develop algorithms for orthogonal similarity transformations of skew-symmetric matrices to simpler forms. The first algorithm is similar to the algorithm for the block antitriangular factorization of symmetric matrices, but…
This paper proposes uni-orthogonal and bi-orthogonal nonnegative matrix factorization algorithms with robust convergence proofs. We design the algorithms based on the work of Lee and Seung [1], and derive the converged versions by utilizing…
A randomized Gram-Schmidt algorithm is developed for orthonormalization of high-dimensional vectors or QR factorization. The proposed process can be less computationally expensive than the classical Gram-Schmidt process while being at least…
This paper studies an optimization problem on the sum of traces of matrix quadratic forms in $m$ semi-orthogonal matrices, which can be considered as a generalization of the synchronization of rotations. While the problem is nonconvex, the…
In a recent paper, the authors introduced the notion of an alternating snake and a corresponding family of finite dimensional modules for the quantum affine algebra associated to $A_n$. We prove that under some restrictions, an alternating…
We prove that every holomorphic symplectic matrix can be factorized as a product of holomorphic unitriangular matrices with respect to the symplectic form $ \left[\begin{array}{ccc} 0 & L_n \\ -L_n & 0\end{array}\right]$ where $L$ is the $n…
Braid matrices $\hat{R}(\theta)$, corresponding to vector representations, are spectrally decomposed obtaining a ratio $f_{i}(\theta)/f_{i}(-\theta)$ for the coefficient of each projector $P_{i}$ appearing in the decomposition. This…
Assume that $\{a_{n};\,n\geq0\}$ is a sequence of positive numbers and $\sum a_{n}^{\,-1}<\infty$. Let $\alpha_{n}=ka_{n}$, $\beta_{n}=a_{n}+k^{2}a_{n-1}$ where $k\in(0,1)$ is a parameter, and let $\{P_{n}(x)\}$ be an orthonormal polynomial…
The speed of convergence of the R-linear GMRES is bounded in terms of a polynomial approximation problem on a finite subset of the spectrum. This result resembles the classical GMRES convergence estimate except that the matrix involved is…