Related papers: Inclusion Matrices and Chains
A matrix is incomplete when some of its entries are missing. A Robinson incomplete symmetric matrix is an incomplete symmetric matrix whose non-missing entries do not decrease along rows and columns when moving toward the diagonal. A…
This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic properties and interpretations of Smith normal form, critical groups of graphs, and Smith…
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common framework capturing common vertex elimination orderings of…
In this paper we derive new sufficient conditions for a linear system matrix $$S(\lambda):=\left[\begin{array}{ccc} T(\lambda) & -U(\lambda) \\ V(\lambda) & W(\lambda) \end{array}\right],$$ where $T(\lambda)$ is assumed regular, to be…
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
Consider an $n\times n$ matrix $P$ with the following properties. All entries in $P$ are positive or $0$, the sum of each row is 1 and for all $i$ and $j$ in $\{1,\dots,n\}$ there exists a natural number $k$ such that the $(i,j)$ entry of…
A Robinson similarity matrix is a symmetric matrix where the entry values on all rows and columns increase toward the diagonal. Decompose the Robinson matrix into the sum of k {0, 1}-matrices, then these k {0, 1}-matrices are the adjacency…
Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in S_n which contain a given permutation \tau in S_k as a subsequence; this number depends on the patterns of the first j values of \tau for 1<=j<=k. We…
Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…
We study level statistics in ensembles of integrable $N\times N$ matrices linear in a real parameter $x$. The matrix $H(x)$ is considered integrable if it has a prescribed number $n>1$ of linearly independent commuting partners $H^i(x)$…
Patterned random matrices such as the reverse circulant, the symmetric circulant, the Toeplitz and the Hankel matrices and their almost sure limiting spectral distribution (LSD), have attracted much attention. Under the assumption that the…
Let $R$ be a ring with unit. Passing to the colimit with respect to the standard inclusions $GL(n,R) \to GL(n+1,R)$ (which add a unit vector as new last row and column) yields, by definition, the stable linear group $GL(R)$; the same result…
Let r >= s >= 0 be integers and G be an r-graph. The higher inclusion matrix M_s^r(G) is a {0,1}-matrix with rows indexed by the edges of G and columns indexed by the subsets of V(G) of size s: the entry corresponding to an edge e and a…
We consider a Markov chain on non-negative integer arrays of a given shape (and satisfying certain constraints) which is closely related to fundamental $SL(r+1,\mathbb{R})$ Whittaker functions and the Toda lattice. In the index zero case…
Consider an integer associated with every subset of the set of columns of an $n\times k$ matrix. The collection of those matrices for which the rank of a union of columns is the predescribed integer for every subset, will be denoted by…
For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…
We study the distribution of the outliers in the spectrum of finite rank deformations of Wigner random matrice under the assumption that the off-diagonal matrix entries have uniformly bounded fifth moment and the diagonal entries have…
We consider $N\times N$ random matrices of the form $H=W+V$ where $W$ is a real symmetric or complex Hermitian Wigner matrix and $V$ is a random or deterministic, real, diagonal matrix whose entries are independent of $W$. We assume…
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…
A partial matrix over a field $\mathbb{F}$ is a matrix whose entries are either an element of $\mathbb{F}$ or an indeterminate and with each indeterminate only appearing once. A completion is an assignment of values in $\mathbb{F}$ to all…