Related papers: Vieta Matrix and its Determinant

Let $C(n,p)$ be the set of $p$-compositions of an integer $n$, i.e., the set of $p$-tuples $\bm{\alpha}=(\alpha_1,...,\alpha_p)$ of nonnegative integers such that $\alpha_1+...+\alpha_p=n$, and $\mathbf{x}=(x_1,...,x_p)$ a vector of…

We give a combinatorial interpretation of the determinant of a matrix as a generating function over Brauer diagrams in two different but related ways. The sign of a permutation associated to its number of inversions in the Leibniz formula…

In this paper, in continuation of our work, on the determinants of cubic -matrix of order 2 and order 3, we have analyzed the possibilities of developing the concept of determinant of cubic-matrix with three indexes, studying the…

In this paper, we define a braid invariant, the purified determinant $P(b)$ of a braid $b$, considering the determinant of the crossing matrix of a pure braid derived from $b$, and show that $P(b_1 b_2)=P(b_2 b_1)$ for any pair of…

We prove that for writing the 3 by 3 permanent polynomial as a determinant of a matrix consisting only of zeros, ones, and variables as entries, a 7 by 7 matrix is required. Our proof is computer based and uses the enumeration of bipartite…

This note deals with two topics of linear algebra. We give a simple and short proof of the multiplicative property of the determinant and provide a constructive formula for rotations. The derivation of the rotation matrix relies on simple…

We consider the matrix ${\frak Z}_P=Z_P+Z_P^t$, where the entries of $Z_P$ are the values of the zeta function of the finite poset $P$. We give a combinatorial interpretation of the determinant of ${\frak Z}_P$ and establish a recursive…

We present a simple, yet useful result about the expected value of the determinant of random sum of rank-one matrices. Computing such expectations in general may involve a sum over exponentially many terms. Nevertheless, we show that an…

We give an explicit determinant formula for a class of rational solutions of the Painlev\'e V equation in terms of the universal characters.

In a celebrated paper of 1893, Hadamard established the maximal determinant theorem, which establishes an upper bound on the determinant of a matrix with complex entries of norm at most $1$. His paper concludes with the suggestion that…

A unimodular $2\times 2$ matrix $A$ with entries in a commutative ring $R$ is called weakly determinant liftable if there exists a matrix $B$ congruent to $A$ modulo $R\det(A)$ and $\det(B)=0$; if we can choose $B$ to be unimodular, then…

Let $K$ denote a field, and let $V$ denote a vector space over $K$ with finite positive dimension. We consider a pair of linear transformations $A:V \to V$ and $A^*: V \to V$ that satisfy (i), (ii) below: (i) There exists a basis for $V$…

We prove that $\det A\leq 6^\frac{n}{6}$ whenever $A\in\{0,1\}^{n\times n}$ contains at most $2n$ ones. We also prove an upper bound on the determinant of matrices with the $k$-consecutive ones property, a generalisation of the consecutive…

Graham and Winkler derived a formula for the determinant of the distance matrix of a full-dimensional set of $n + 1$ points $\{ x_{0}, x_{1}, \ldots , x_{n} \}$ in the Hamming cube $H_{n} = ( \{ 0,1 \}^{n}, \ell_{1} )$. In this article we…

We solve the problem of effectively computing the $a$-invariant of ladder determinantal rings. In the case of a one-sided ladder, we provide a compact formula, while, for a large family of two-sided ladders, we provide an algorithmic…

We describe algorithms for computing maximal determinants of binary circulant matrices of small orders. Here "binary matrix" means a matrix whose elements are drawn from $\{0,1\}$ or $\{-1,1\}$. We describe efficient parallel algorithms for…

A strongly connected digraph is called a cactoid-type if each of its blocks is a digraph consisting of finitely many oriented cycles sharing a common directed path. In this article, we find the formula for the determinant of the distance…

In this paper, a new kind of resultant, called the determinantal resultant, is introduced. This operator computes the projection of a determinantal variety under suitable hypothesis. As a direct generalization of the resultant of a very…

A new class of structured matrices is presented and a closed form formula for their determinant is established. This formula has strong connections with the one for Vandermonde matrices.

A compound determinant identity for minors of rectangular matrices is established. As an application, we derive Vandermonde type determinant formulae for classical group characters.