Related papers: Matrices with integer eigenvalues for all permutat…
We search for triangular numbers that are multiples of other triangular numbers. It is found that for any positive non-square integer multiplier, there is an infinity of multiples of triangular numbers that are triangular numbers and…
The probability that a tuple of matrices together with all scalars generates a finite incidence ring is calculated. It is proved that all real and complex finite-dimensional incidence algebras are generated by two randomly chosen matrices.
Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…
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…
Starting from a mistake done by a student, we discover an unexpected method of finding both eigenvectors for a $2\times2$ matrix with distinct eigenvalues in a single computation. We discuss a connection with the Cayley-Hamilton theorem,…
We study the graphs generated when the formula for linking Markov triples is applied to general triples of integers. We find there are a finite number of equivalence classes of graphs, each with particular properties.
It is known that for a totally positive (TP) matrix, the eigenvalues are positive and distinct and the eigenvector associated with the smallest eigenvalue is totally nonzero and has an alternating sign pattern. Here, a certain weakening of…
For matrices with all nonnegative entries, the Perron-Frobenius theorem guarantees the existence of an eigenvector with all nonnegative components. We show that the existence of such an eigenvector is also guaranteed for a very different…
We give an easy algorithm which calculates the generating function of the cocharacter sequence of the T-ideal of the polynomial identities of the algebra of upper triangular matrices over a field of characteristic zero. Applying this…
Discrete orthogonal matrices have several applications in information technology, such as in coding and cryptography. It is often challenging to generate discrete orthogonal matrices. A common approach widely in use is to discretize…
We first study birational mappings generated by the composition of the matrix inversion and of a permutation of the entries of $ 3 \times 3 $ matrices. We introduce a semi-numerical analysis which enables to compute the Arnold complexities…
We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its…
The infinite matrices in Witten's vertex are easy to diagonalize. It just requires some SL(2,R) lore plus a Watson-Sommerfeld transformation. We calculate the eigenvalues of all Neumann matrices for all scale dimensions s, both for matter…
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.
In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…
The paper presents a systematic construction of primitive Pythagorean triples. The order of enumeration on the set of primitive Pythagorean triples is defined. The order is based on the representation of a primitive Pythagorean triple by…
Equiangular Algorithm generates a set of equiangular normalized vectors with given angle {\theta} using a set of linearly independence vectors in a real inner product space, which span the same subspaces. The outcome of EA on column vectors…
Formulas for matrix determinants, algebraic adjunctions, characteristic polynomial coefficients, components of eigenvectors are obtained in the form of signless sums of matrix elements products taking by special graphs. Signless formulas…
We present in this paper some fundamental tools for developing matrix analysis over the complex quaternion algebra. As applications, we consider generalized inverses, eigenvalues and eigenvectors, similarity, determinants of complex…
Matrices are very popular and widely used in mathematics and other fields of science. Every mathematician has known the properties of finite-sized matrices since the time of study. In this paper, we consider the basic theory of infnite…