Related papers: Factorizations of Matrices With Recursive Entries …
We investigate $(0,1)$-matrices that are {\em convex}, which means that the ones are consecutive in every row and column. These matrices occur in discrete tomography. The notion of ranked essential sets, known for permutation matrices, is…
Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…
In this paper we use matrices, whose entries satisfy certain linear conditions, to obtain composition identities $f(x_i)f(y_i)=f(z_i)$, where $f(x_i)$ is an irreducible form, with integer coefficients, of degree $n$ in $n$ variables ($n$…
Let $A=[a_{n,k}]_{n,k\ge 0}$ be an infinite lower triangular matrix defined by the recurrence $$a_{0,0}=1,\quad a_{n+1,k}=r_{k}a_{n,k-1}+s_{k}a_{n,k}+t_{k+1}a_{n,k+1},$$ where $a_{n,k}=0$ unless $n\ge k\ge 0$ and $r_k,s_k,t_k$ are all…
We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…
Sparse matrix factorization is the problem of approximating a matrix $\mathbf{Z}$ by a product of $J$ sparse factors $\mathbf{X}^{(J)} \mathbf{X}^{(J-1)} \ldots \mathbf{X}^{(1)}$. This paper focuses on identifiability issues that appear in…
The work considers an equivalence relation in the set of all $n\times m$ matrices with entries in the set $[p]=\{ 0,1,\ldots , p-1 \}$. In each element of the factor-set generated by this relation, we define the concept of canonical matrix,…
We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These…
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…
This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…
This study examines the properties of an r-circulant matrix whose entries are defined by the generalized k-Pell-Tribonacci sequence {P_k,n}. Explicit expressions are derived for the Frobenius (Euclidean) norm and the entrywise \ell_1-norm,…
If a matrix $A$ has rank $r$, then its row echelon form (from elimination) contains the identity matrix in its first $r$ independent columns. How do we \emph{interpret the matrix} $F$ that appears in the remaining columns of that echelon…
Convenient parameterizations of matrices in terms of vectors transform (certain classes of) matrix equations into covariant (hence rotation-invariant) vector equations. Certain recently introduced such parameterizations are tersely…
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)$,…
Through the following, we establish the conditions which allow us to express recursive sequences of real numbers, enumerated through the recurrence relation a_{n+1} = Aa_n + Ba_{n-1}, by means of algebraic equations in two variables of…
We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…
We study characteristic polynomials of symmetric matrices with entries ${i+j\choose i}$ the binomial coefficients, over finite fields.
We study copositive matrices which admit a decomposition into a sum of a positive semidefinite matrix and a matrix with nonnegative entries. Our main result shows that if the off-diagonal entries of a copositive matrix are nondecreasing in…
A simple recursive scheme for parameterisation of n-by-n unitary matrices is presented.
By definition, reciprocal matrices are tridiagonal $n$-by-$n$ matrices $A$ with constant main diagonal and such that $a_{i,i+1}a_{i+1,i}=1$ for $i=1,\ldots,n-1$. For $n\leq 6$, we establish criteria under which the numerical range…