Related papers: Matrices similar to centrosymmetric matrices
The stories told in this paper are dealing with the solution of finite, infinite, and biinfinite Toeplitz-type systems. A crucial role plays the off-diagonal decay behavior of Toeplitz matrices and their inverses. Classical results of…
In this paper we explore a family of congruences over $\N^\ast$ from which one builds a sequence of symmetric matrices related to the Mertens function. From the results of numerical experiments, we formulate a conjecture about the growth of…
Toeplitz matrices are ubiquitous and play important roles across many areas of mathematics. In this paper, we present some algebraic results concerning block Toeplitz matrices with block entries belonging to a commutative algebra $\AA$. The…
The four major asymptotic level density laws of random matrix theory may all be showcased though their Jacobi parameter representation as having a bordered Toeplitz form. We compare and contrast these laws, completing and exploring their…
We show that every n-by-n matrix is generically a product of [n/2] + 1 Toeplitz matrices and always a product of at most 2n+5 Toeplitz matrices. The same result holds true if the word "Toeplitz" is replaced by "Hankel", and the generic…
We describe a class of matrices whose determinants are trivial to compute. A nice example of such a matrix is given by considering the symmetric matrix with entries {i+j choose i} (mod 2) in {0,1}, 0 <= i,j < n the binomial coefficients…
In this paper we give a first study of perfect copositive $n \times n$ matrices. They can be used to find rational certificates for completely positive matrices. We describe similarities and differences to classical perfect, positive…
A real symmetric matrix (resp., tensor) is said to be copositive if the associated quadratic (resp., homogeneous) form is greater than or equal to zero over the nonnegative orthant. The problem of detecting their copositivity is NP-hard.…
We analyze the asymptotic fluctuations of linear eigenvalue statistics of random centrosymmetric matrices with i.i.d. entries. We prove that for a complex analytic test function, the centered and normalized linear eigenvalue statistics of…
The condition number of a diagonally scaled matrix, for appropriately chosen scaling matrices, is often less than that of the original. Equilibration scales a matrix so that the scaled matrix's row and column norms are equal. Scaling can be…
A matrix is apportionable if it is similar to a matrix whose entries have equal moduli. This paper shows that all nilpotent matrices and all matrices with rank at most half their order are apportionable. General results are established and…
This article is devoted to the study of the centralizer and the clifforder of a matrix over a field $\mathbb{F}$ of characteristic zero, as well as the quasi-commutative relations between matrices over the complex field $\mathbb{C}$. We…
Motivated by a problem of Halmos, we obtain a canonical decomposition for complex matrices which are unitarily equivalent to their transpose (UET). Surprisingly, the naive assertion that a matrix is UET if and only if it is unitarily…
It is known that that the centralizer of a matrix over a finite field depends, up to conjugacy, only on the type of the matrix, in the sense defined by J. A. Green. In this paper an analogue of the type invariant is defined that in general…
We consider a symmetric matrix, the entries of which depend linearly on some parameters. The domains of the parameters are compact real intervals. We investigate the problem of checking whether for each (or some) setting of the parameters,…
We extend Latimer and MacDuffee's theorem to a general commutative domain and apply this result to study similarity of matrices over integral rings of number fields. We also conjecture similarity over discrete valuation rings can be descent…
Schemes for exact multiplication of small matrices have a large symmetry group. This group defines an equivalence relation on the set of multiplication schemes. There are algorithms to decide whether two schemes are equivalent. However, for…
We find necessary and sufficient conditions for $P$-equivalence of arbitrary matrices and $P$-congruence of symmetric and alternating matrices, where $P$ is standard parabolic subgroup of $GL_n(F)$ and $F$ is an arbitrary field.
Matrices are two-dimensional data structures allowing one to conceptually organize information. For example, adjacency matrices are useful to store the links of a network; correlation matrices are simple ways to arrange gene co-expression…
We consider square matrices A that commute with a fixed square matrix K, both with entries in a field F not of characteristic 2. When K^2=I, Tao and Yasuda defined A to be generalized centrosymmetric with respect to K. When K^2=-I, we…