Papers
Topics
Authors
Recent
Search
2000 character limit reached

Skew-symmetric matrices and their principal minors

Published 1 Mar 2014 in math.CO | (1403.0095v2)

Abstract: Let $V$ be a nonempty finite set and $A=(a_{ij}){i,j\in V}$ be a matrix with entries in a field $\mathbb{K}$. For a subset $X$ of $V$, we denote by $A[X]$ the submatrix of $A$ having row and column indices in $X$. We study the following problem. Given a positive integer $k$, what is the relationship between two matrices $A=(a{ij}){i,j\in V}$, $B=(b{ij})_{i,j\in V}$ with entries in $\mathbb{K}$ and such that $\det(A\left[ X\right])=\det(B\left[ X\right])$ for any subset $X$ of $V$ of size at most $k$ ? The Theorem that we get in this Note is an improvement of a result of R. Loewy [5] for skew-symmetric matrices whose all off-diagonal entries are nonzero.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.