Related papers: A Universal Closed Form For Square Matrix Powers
We give exact formulas for the transmission (i.e. the sum of all distances between vertices) of perfect trees and rooted powers of (connected finite) graphs.
We give an algorithm that uses only unitary transformations and for each square complex matrix constructs a *congruent matrix that is a direct sum of a nonsingular matrix and singular Jordan blocks.
We consider the sum of squares function in the ring $\mathbb{Z}_{n}$. We determine formulae in a number of cases when $n$ is a power of a prime.
Sums-of-squares formulas over the integers have been studied extensively using their equivalence to consistently signed intercalate matrices. This representation, combined with combinatorial arguments, has been used to produce…
Recent results about sums of cubes of Fibonacci numbers [Frontczak, 2018] are extended to arbitrary powers.
The equivalence of multidimensional systems is closely related to the reduction of multivariate polynomial matrices, with the Smith normal form of matrices playing a key role. So far, the problem of reducing multivariate polynomial matrices…
When doubly-affine matrices such as Latin and magic squares with a single non-zero eigenvalue are powered up they become constant matrices after a few steps. The process of compounding squares of orders m and n can then be used to generate…
A square matrix is nonderogatory if its Jordan blocks have distinct eigenvalues. We give canonical forms (i) for nonderogatory complex matrices up to unitary similarity and (ii) for pairs of complex matrices up to similarity, in which one…
We consider a holomorphic 1-form $\omega$ with an isolated zero on an isolated complete intersection singularity $(V,0)$. We construct quadratic forms on an algebra of functions and on a module of differential forms associated to the pair…
We give a short proof -- not relying on ideal classes or the geometry of numbers -- of a known criterion for quadratic orders to possess unique factorization.
In this article, the ring of polynomials is studied in a systematic way through the theory of monoid rings. As a consequence, this study provides natural and canonical approaches in order to find easy and rigorous proofs and methods for…
Every state on the algebra $M_n$ of complex nxn matrices restricts to a state on any matrix system. Whereas the restriction to a matrix system is generally not open, we prove that the restriction to every *-subalgebra of $M_n$ is open. This…
In this paper, we give estimates for both upper and lower bounds of eigenvalues of a simple matrix. The estimates are shaper than the known results.
Schur decompositions and the corresponding Schur forms of a single matrix, a pair of matrices, or a collection of matrices associated with the periodic eigenvalue problem are frequently used and studied. These forms are upper-triangular…
The classical quadratic Gauss sum can be thought of as an exponential sum attached to a quadratic form on a cyclic group. We introduce an equivariant version of Gauss sum for arbitrary finite quadratic forms, which is an exponential sum…
Remarkably simple closed-form expressions for the elements of the groups SU(n), SL(n,R), and SL(n,C) with n=2, 3, and 4 are obtained using linear functions of biquaternions instead of n x n matrices. These representations do not directly…
We determine all perfect powers that can be written as the sum of at most 10 consecutive squares.
This note provides new closed forms evaluations of a few classes of exponential sums associated with elliptic curves and hyperelliptic curves.
In this paper we deal with the problem of computing the sum of the $k$-th powers of all the elements of the matrix ring $\mathbb{M}_d(R)$ with $d>1$ and $R$ a finite commutative ring. We completely solve the problem in the case…
The notion of entangling power of unitary matrices was introduced by Zanardi, Zalka and Faoro [PRA, 62, 030301]. We study the entangling power of permutations, given in terms of a combinatorial formula. We show that the permutation matrices…