Related papers: Degree Complexity of Matrix Inversion

The reciprocal Pascal matrix has entries $\binom{i+j}{j}^{-1}$. Explicit formullae for its LU-decomposition, the LU-decomposition of its inverse, and some related matrices are obtained. For all results, $q$-analogues are also presented.

The spectral properties of a class of band matrices are investigated. The reconstruction of matrices of this special class from given spectral data is also studied. Necessary and sufficient conditions for that reconstruction are found. The…

We present here the necessary and sufficient conditions for the invertibility of tridiagonal matrices, commonly named Jacobi matrices, and explicitly compute their inverse. The techniques we use are related with the solution of…

This paper studies the space of degree $d>1$ invariant q-laminations, i.e., geodesic laminations invariant under the $d$-tupling map of the circle and associated with equivalence relations. Our main construction associates a q-lamination…

In this paper, I give sufficient conditions for any linear combination in $\mathbb{Q}$ of numbers $\sum_{n=1}^{\infty}\frac{b_{1,n}}{\alpha_{1,n}}$, $\ldots$, $\sum_{n=1}^{\infty}\frac{b_{K,n}}{\alpha_{K,n}}$ to have algebraic degree…

We consider matrix orthogonal polynomials related to Jacobi type matrices of weights that can be defined in terms of a given matrix Pearson equation. Stating a Riemann-Hilbert problem we can derive first and second order differential…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over the field $K$, and let $I\subset S$ be a graded ideal. It is shown that the higher iterated Hilbert coefficients of the graded $S$-modules $\Tor_i^S(M,I^k)$ and $\Ext^i_S(M,I^k)$ are…

We make two observations regarding the invertibility of Keller maps. i.e., polynomial maps for which the determinant of their Jacobian matrix is identically equal to 1. In our first result, we show that if P is a n-dimensional Keller map,…

The joint degree matrix of a graph gives the number of edges between vertices of degree i and degree j for every pair (i,j). One can perform restricted swap operations to transform a graph into another with the same joint degree matrix. We…

Let G be an arbitrary group and let K be a field of characteristic different from 2. We classify the G-gradings on the Jordan algebra of upper triangular matrices of order n over K. It turns out that there are, up to a graded isomorphism,…

Inverse iteration is known to be an effective method for computing eigenvectors corresponding to simple and well-separated eigenvalues. In the non-symmetric case, the solution of shifted Hessenberg systems is a central step. Existing…

Let $G$ be a connected graph on $n$ vertices and $d_{ij}$ be the length of the shortest path between vertices $i$ and $j$ in $G$. We set $d_{ii}=0$ for every vertex $i$ in $G$. The squared distance matrix $\Delta(G)$ of $G$ is the $n\times…

We consider the $n\times n$ Hankel matrix $H$ whose entries are defined by $H_{ij}=1/s_{i+j}$ where $s_k=(k-1)!$ and prove that $H$ is invertible for all $n\in\mathbb{N}$ by providing an explicit formula for its inverse matrix.

A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…

We consider positive Jacobi matrices $J$ with compact inverses and consequently with purely discrete spectra. A number of properties of the corresponding sequence of orthogonal polynomials is studied including the convergence of their…

We introduce a new set of algorithms to compute Jacobi matrices associated with measures generated by infinite systems of iterated functions. We demonstrate their relevance in the study of theoretical problems, such as the continuity of…

The intended purpose of this work is to provide the reader with a comprehensive, state-of-the art presentation of the theory of complex Hadamard matrices, or at least report on the very recent advances. This manuscript consists of three…

We construct ensembles of random integrable matrices with any prescribed number of nontrivial integrals and formulate integrable matrix theory (IMT) -- a counterpart of random matrix theory (RMT) for quantum integrable models. A type-M…

The present paper deals with the discrete inverse problem of reconstructing binary matrices from their row and column sums under additional constraints on the number and pattern of entries in specified minors. While the classical…

A trade in a complex Hadamard matrix is a set of entries which can be changed to obtain a different complex Hadamard matrix. We show that in a real Hadamard matrix of order $n$ all trades contain at least $n$ entries. We call a trade…