Related papers: The Pascal Matrix, Commuting Tridiagonal Operators…
Let $\mathbb F$ denote a field and let $V$ denote a vector space over $\mathbb F$ with finite positive dimension. We consider a pair of linear transformations $A:V\to V$ and $A^*:V\to V$ that satisfies the following conditions: (i) each of…
Any representation of data involves arbitrary investigator choices. Because those choices are external to the data-generating process, each choice leads to an exact symmetry, corresponding to the group of transformations that takes one…
We solve the problem of Fourier transformation for the one-dimensional $q$-deformed Heisenberg algebra. Starting from a matrix representation of this algebra we observe that momentum and position are unbounded operators in the Hilbert…
We prove several evaluations of determinants of matrices, the entries of which are given by the recurrence $a_{i,j}=a_{i-1,j}+a_{i,j-1}$, or variations thereof. These evaluations were either conjectured or extend conjectures by Roland…
Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. We consider an ordered pair of linear transformations $A:V\to V$ and $A^*:V\to V$ that satisfy conditions (i), (ii) below. (i) There exists a…
Orthogonal polynomials on the real line always satisfy a three-term recurrence relation. The recurrence coefficients determine a tridiagonal semi-infinite matrix (Jacobi matrix) which uniquely characterizes the orthogonal polynomials. We…
The problem of diagonalizing a class of complicated matrices, to be called ultrametric matrices, is investigated. These matrices appear at various stages in the description of disordered systems with many equilibrium phases by the technique…
We construct a class of representations of the quadratic R-matrix algebra, given by the reflection equation with the spectral parameter, in terms of certain ordinary difference operators. These operators turn out to act as parameter…
A common algorithm for the computation of eigenvalues of real symmetric tridiagonal matrices is the iteration of certain special maps $F_\sigma$ called shifted $QR$ steps. Such maps preserve spectrum and a natural common domain is ${\cal…
Let $V$ be a vector space over a field $\mathbb F$ with scalar product given by a nondegenerate sesquilinear form whose matrix is diagonal in some basis. If $\mathbb F=\mathbb C$, then we give canonical matrices of isometric and selfadjoint…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
We generalize the concept of Pascal matrices to matrices associated with sets of points by considering multidimensional binomial coefficients as entries. We study their properties and prove that the infinite matrix associated with the set…
We provide a solution to the problem of simultaneous $diagonalization$ $via$ $congruence$ of a given set of $m$ complex symmetric $n\times n$ matrices $\{A_{1},\ldots,A_{m}\}$, by showing that it can be reduced to a possibly…
Although a good portion of elementary linear algebra concerns itself with matrices over a field such as $\mathbb{R}$ or $\mathbb{C}$, many combinatorial problems naturally surface when we instead work with matrices over a finite field. As…
The p-adic formulation of replica symmetry breaking is presented. In this approach ultrametricity is a natural consequence of the basic properties of the p-adic numbers. Many properties can be simply derived in this approach and p-adic…
The aim of this paper is to study determinants of matrices related to the Pascal triangle.
The Householder reduction of a member of the anti-symmetric Gaussian unitary ensemble gives an anti-symmetric tridiagonal matrix with all independent elements. The random variables permit the introduction of a positive parameter $\beta$,…
In this paper we discuss general tridiagonal matrix models which are natural extensions of the ones given by Dumitriu and Edelman. We prove here the convergence of the distribution of the eigenvalues and compute the limiting distributions…
We find the eigenvalues and eigenvectors of the n by n matrix with (i,j) entry \binom(i-1,n-j), establishing a conjecture of Peele and Stanica. Curiously, the eigenvectors can be chosen to form a matrix which is its own inverse.
For given k distinct complex conjugate pairs, l distinct real numbers, and a given graph G on 2k+l vertices with a matching of size at least k, we will show that there is a real matrix whose eigenvalues are the given numbers and its graph…