Related papers: Linear maps preserving the Cullis' determinant. I
The aim of this paper is to study linear preservers of the trace of Kronecker sums and their connection with preservers of determinants of Kronecker products. The partial trace and partial determinant play a fundamental role in…
The object of this paper is to introduce a new and fascinating method of solving large linear equations, based on Cramer's rule or Gaussian elimination but employing Sylvester's determinant identity in its computation process. In addition,…
The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a…
In this paper we give necessary and sufficient trace conditions for an n by n matrix over any commutative and associative ring with unity to be a sum of k-th powers of matrices over that ring, where n,k are integers greater equal 2. We…
Linear maps preserving pure states of a quantum system of any dimension are characterized. This is then used to establish a structure theorem for linear maps that preserve separable pure states in multipartite systems. As an application, a…
Let $V$ be the set of $n\times n$ complex or real general matrices, Hermitian matrices, symmetric matrices, positive definite (resp. semi-definite) matrices, diagonal matrices, or upper triangular matrices. Fix $k\in \mathbb{Z}\setminus…
In this paper we explore determinantal representations of multiaffine polynomials and consequences for the image of various spaces of matrices under the principal minor map. We show that a real multiaffine polynomial has a definite…
In this paper, we give some determinantal and permanental representations of Generalized Lucas Polynomials by using various Hessenberg matrices, which are general form of determinantal and permanental representations of ordinary Lucas and…
Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…
Algorithms involving Gaussian processes or determinantal point processes typically require computing the determinant of a kernel matrix. Frequently, the latter is computed from the Cholesky decomposition, an algorithm of cubic complexity in…
In this article, we shall derive by elementary calculations the Gauss map, spherical image, Weingarten map and the curvatures at identity of the special linear group, that is, the matrices of determinant 1. We could not find any reference…
Determinants of structured matrices play a fundamental role in both pure and applied mathematics, with wide-ranging applications in linear algebra, combinatorics, coding theory, and numerical analysis. In this work, the enumeration of…
We compute and study two determinantal representations of the discriminant of a cubic quaternary form. The first representation is the Chow form of the $2$-uple embedding of $\mathbb{P}^3$ and is computed as the Pfaffian of the Chow form of…
The $k$-ellipse is the plane algebraic curve consisting of all points whose sum of distances from $k$ given points is a fixed number. The polynomial equation defining the $k$-ellipse has degree $2^k$ if $k$ is odd and degree…
Let $\mathbb{F}$ be a field and $f : \mathfrak{S}_n \rightarrow \mathbb{F} \setminus \{0\}$ be an arbitrary map. The Schur matrix functional associated to $f$ is defined as $M \in \text{M}_n(\mathbb{F}) \mapsto…
Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…
What polynomial in the coefficients of a system of algebraic equations should be called its discriminant? We prove a package of facts that provide a possible answer. Let us call a system typical, if the homeomorphic type of its set of…
We consider the NP-hard problem of minimizing a separable concave quadratic function over the integral points in a polyhedron, and we denote by D the largest absolute value of the subdeterminants of the constraint matrix. In this paper we…
We interpret a formula established by Lapid-M\'{\i}nguez on real regular representations of ${\rm GL}_n$ over a local non-archimedean field as a matrix determinant. We use the Lewis Carroll determinant identity to prove new relations…
In this paper, we study the complexity of computing the determinant of a matrix over a non-commutative algebra. In particular, we ask the question, "over which algebras, is the determinant easier to compute than the permanent?" Towards…