Related papers: Commutation matrices and Commutation tensors
A unified approach to parametrization of the mixing matrix for $N$ generations is developed. This approach not only has a clear geometrical underpinning but also has the advantage of being economical and recursive and leads in a natural way…
Consider the regular representation of the sum over all permutations weighted by the sum of their descent, inversion, and fixed point multinomials. We compute the spectrum and the multiplicities of its elements of that matrix. Note that…
A selfadjoined block tridiagonal matrix with positive definite blocks on the off-diagonals is by definition a Jacobi matrix with matrix entries. Transfer matrix techniques are extended in order to develop a rotation number calculation for…
It is a classical result in matrix algebra that any square matrix over a field can be conjugated to its transpose by a symmetric matrix. For $F$ a non-Archimedean local field, Tupan used this to give an elementary proof that transpose…
The probability that the commutator of two group elements is equal to a given element has been introduced in literature few years ago. Several authors have investigated this notion with methods of the representation theory and with…
We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…
In this paper, we introduce the fundamental notion of a Markov basis, which is one of the first connections between commutative algebra and statistics. The notion of a Markov basis is first introduced by Diaconis and Sturmfels (1998) for…
Transfer Maps, sometimes called norm maps, for Milnor's $K$-theory were first defined by Bass and Tate (1972) for simple extensions of fields via tame symbol and Weil's reciprocity law, but their functoriality had not been settled until…
In the presence of CP violation, the effective Hamiltonian matrix describing a neutral meson anti-meson system does not commute with its hermitian conjugate. As a result, this matrix cannot be diagonalized by a unitary transformation and…
We prove upper and lower bounds on the number of pairs of commuting $n\times n$ matrices with integer entries in $[-T,T]$, as $T\to \infty$. Our work uses Fourier analysis and leads us to an analysis of exponential sums involving matrices…
Matrix congruence extends naturally to the setting of tensors. We apply methods from tensor decomposition, algebraic geometry and numerical optimization to this group action. Given a tensor in the orbit of another tensor, we compute a…
In this paper, we present a partial survey of the tools borrowed from tensor algebra, which have been utilized recently in Statistics and Signal Processing. It is shown why the decompositions well known in linear algebra can hardly be…
Transforms using random matrices have been found to have many applications. We are concerned with the projection of a signal onto Gaussian-distributed random orthogonal bases. We also would like to easily invert the process through…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
We construct two sets of representations of the Dirac equation. They transform themselves from one to another in multiplying by the tensor commutation matrix (TCM) $2\otimes 2$. The Gauss matrix can lead us to the Cholesky decomposition.…
Convolution admits a natural formulation as a functional operation on matrices. Motivated by the functional and entrywise calculi, this leads to a framework in which convolution defines a matrix transform that preserves positivity. Within…
This is the second of a series of papers surveying some small part of the remarkable work of our friend and colleague Nigel Kalton. We have written it as part of a tribute to his memory. It does not contain new results. One of the many…
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…
This article is an introductory review of random matrix theory (RMT) and its applications, with special focus on quantum chaos. Random matrices were first used by Wigner to understand the spectra of complex nuclei from a statistical…
In this paper we introduce the notion of linear computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.