On R. Chapman's "evil determinant": case p ≡ 1 (mod 4)
For p ≡ 1 (mod 4), we prove the formula (conjectured by R. Chapman) for the determinant of the (p+1)/2 × (p+1)/2 matrix with .
For p ≡ 1 (mod 4), we prove the formula (conjectured by R. Chapman) for the determinant of the (p+1)/2 × (p+1)/2 matrix with .
No polynomial algorithms are known for finding the coefficients of the characteristic polynomial and characteristic equation of a matrix in max- algebra. The following are proved: (1) The task of finding the max-algebraic characteristic polynomial for permutation matrices encoded using the lengths of their constituent cycles is NP-complete. (2) The task of finding the lowest order finite term of the max-algebraic characteristic polynomial for a matrix can be converted to the assignment problem....
The main contribution of this work is to provide two algorithms for the computation of the minimal polynomial of univariate polynomial matrices. The first algorithm is based on the solution of linear matrix equations while the second one employs DFT techniques. The whole theory is illustrated with examples.
Let N be a set of natural numbers and Z be a set of integers. Let M₂(Z) denotes the set of all 2x2 matrices with integer entries. We give necessary and suficient conditions for solvability of the matrix negative Pell equation (P) X² - dY² = -I with d ∈ N for nonsingular X,Y belonging to M₂(Z) and his generalization (Pn) with d ∈ N for nonsingular , i=1,...,n.
This paper is concerned with optimal design problems with a special assumption on the coefficients of the state equation. Namely we assume that the variations of these coefficients have a small amplitude. Then, making an asymptotic expansion up to second order with respect to the aspect ratio of the coefficients allows us to greatly simplify the optimal design problem. By using the notion of H-measures we are able to prove general existence theorems for small amplitude optimal design and to provide...