Related papers: Determinants from homomorphisms
We establish a new connection between moments of $n \times n$ random matrices $X_n$ and hypergeometric orthogonal polynomials. Specifically, we consider moments $\mathbb{E}\mathrm{Tr} X_n^{-s}$ as a function of the complex variable $s \in…
We consider a generalized discriminant associated to a symmetric space which generalizes the discriminant of real symmetric matrices, and note that it can be written as a sum of squares of real polynomials. A method to estimate the minimum…
We introduce the triangulant of two matrices, and relate it to the existence of orthogonal eigenvectors. We also use it for a new characterization of mutually unbiased bases. Generalizing the notion, we introduce higher order triangulants…
We extend our investigation of $2$-determinants, which we defined in a previous paper. For a linear homogenous recurrence of the second order, we consider relations between different sequences satisfying the same linear homogeneous…
In this paper the main results in arXiv:0901.3179v3, related to the matrix representation of polynomial maps, are restated in traditional way of linear algebra assuming that variable vectors are presented as column vectors. Some new results…
The determinant is a main organizing tool in commutative linear algebra. In this review we present a theory of the quasideterminants defined for matrices over a division algebra. We believe that the notion of quasideterminants should be one…
One of the aims of this paper is to provide a short survey on the Z2-graded, the symmetric and the left (right) generalizations of the classical determinant theory for square matrices with entries in an arbitrary (possibly non-commutative)…
We study a generalization of the discriminant of a polynomial, which we call the tolerant. The tolerant differs by multiplication by a square from the duplicant, which was discovered in recent work on $\mathbb{P}^1$-loop spaces in motivic…
Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…
Hypergraphs are useful mathematical models for describing complex relationships among members of a structured graph, while hyperdigraphs serve as a generalization that can encode asymmetric relationships in the data. However, obtaining…
In the space of square matrices, we characterize row-generated subspaces, on which the determinant is an irreducible polynomial. As a corollary, we characterize square systems of polynomial equations with indeterminate coefficients, whose…
We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known non-deterministic and algebraic lambda-calculi.
We develop a theory of principal determinants and hypergeometric systems for realizable matroids. Our framework parallels the toric theory of Gel'fand, Kapranov, and Zelevinsky (GKZ), but with the combinatorics of matroids and their flats…
The relationship between algebraic geometry and the inferential framework of the Bayesian Networks with hidden variables has now been fruitfully explored and exploited by a number of authors. More recently the algebraic formulation of…
We present new identities for determinants of matrices $(A_{i,j})$ with entries $A_{i,j}$ equal to $a_{i,j}$ or $a_{i,0}a_{0,j}-a_{i,j}$, where the $a_{i,j}$'s are indeterminates. We show that these identities are behind trace identities…
Given an autohomeomorphism on an ordered topological space or its subspace, we show that it is sometimes possible to introduce a new topology-compatible order on that space so that the same map is monotonic with respect to the new ordering.…
By viewing non-commutative polynomials, that is, elements in free associative algebras, in terms of linear representations, we generalize Horner's rule to the non-commutative (multivariate) setting. We introduce the concept of Horner…
A formula is presented for the determinant of the second additive compound of a square matrix in terms of coefficients of its characteristic polynomial. This formula can be used to make claims about the eigenvalues of polynomial matrices,…
We compute hyperdeterminants of hypermatrices whose indices belongs in a meet-semilattice and whose entries depend only of the greatest lower bound of the indices. One shows that an elementary expansion of such a polynomial allows to…
Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. We characterize the Hamiltonicity of $\Gamma$ via the structure of the cohomology algebra of $A(\Gamma)$. In doing so, we define and develop a…