Related papers: On the almost-principal minors of a symmetric matr…

A minor of a matrix is quasi-principal if it is a principal or an almost-principal minor. The quasi principal rank characteristic sequence (qpr-sequence) of an $n\times n$ symmetric matrix is introduced, which is defined as $q_1 q_2 \cdots…

The signed enhanced principal rank characteristic sequence (sepr-sequence) of a given $n \times n$ Hermitian matrix $B$ is the sequence $t_1t_2 \cdots t_n$, where $t_k$ is $\tt A^*$, $\tt A^+$, $\tt A^-$, $\tt N$, $\tt S^*$, $\tt S^+$, or…

The principal permanent rank characteristic sequence is a binary sequence $r_0 r_1 \ldots r_n$ where $r_k = 1$ if there exists a principal square submatrix of size $k$ with nonzero permanent and $r_k = 0$ otherwise, and $r_0 = 1$ if there…

The enhanced principal rank characteristic sequence (epr-sequence) of an $n \times n$ symmetric matrix over a field $\mathbb{F}$ was recently defined as $\ell_1 \ell_2 \cdots \ell_n$, where $\ell_k$ is either $\tt A$, $\tt S$, or $\tt N$…

The enhanced principal rank characteristic sequence (epr-sequence) of a symmetric matrix $B \in \mathbb{F}^{n \times n}$ is defined as $\ell_1 \ell_2 \cdots \ell_n$, where $\ell_j \in \{\tt{A}, \tt{S}, \tt{N}\}$ according to whether all,…

The signed enhanced principal rank characteristic sequence (sepr-sequence) of an $n \times n$ Hermitian matrix is the sequence $t_1t_2 \cdots t_n$, where $t_k$ is either $\tt A^*$, $\tt A^+$, $\tt A^-$, $\tt N$, $\tt S^*$, $\tt S^+$, or…

Given a real symmetric $n\times n$ matrix, the sepr-sequence $t_1\cdots t_n$ records information about the existence of principal minors of each order that are positive, negative, or zero. This paper extends the notion of the sepr-sequence…

This paper establishes new restrictions for attainable enhanced principal rank characteristic sequences (epr-sequences). These results are then used to classify two related families of sequences that are attainable by a real symmetric…

Principal matrices of a numerical semigroup of embedding dimension n are special types of $n \times n$ matrices over integers of rank $\leq n - 1$. We show that such matrices and even the pseudo principal matrices of size n must have rank…

Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…

We study the problem of low-rank matrix completion for symmetric matrices. The minimum rank of a completion of a generic partially specified symmetric matrix depends only on the location of the specified entries, and not their values, if…

The rank of an n x n matrix A is equal to the size of its largest square submatrix with a nonzero determinant, and it can be computed in O(n^2.37) time. Analogously, the size of the largest square submatrix with nonzero permanent is defined…

Let $S_{n}$ denote the space of all $n \times n$ real symmetric matrices. For n=2 or n>2 we characterize maps F from $S_{n}$ to $S_{m}$ which preserve adjacency, i.e. if rank(A-B)=1, then rank(F(A)-F(B))=1.

Let $A$ be an $n\times n$ random symmetric matrix with independent identically distributed subgaussian entries of unit variance. We prove the following large deviation inequality for the rank of $A$: for all $1\leq k\leq c\sqrt{n}$,…

We show that every principal submatrix of a square matrix $A$ with only entries in $\{0,1,-1\}$ has even rank if and only if $A$ is skew-symmetric up to multiplication of rows/columns by $-1$.

Conditional on the extended Riemann hypothesis, we show that with high probability, the characteristic polynomial of a random symmetric $\{\pm 1\}$-matrix is irreducible. This addresses a question raised by Eberhard in recent work. The main…

Over fields of characteristic unequal to $2$, we can identify symmetric matrices with homogeneous polynomials of degree $2$. This allows us to view symmetric rank-metric codes as living inside the space of such polynomials. In this paper,…

We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…

In [Rank-Width and Well-Quasi-Ordering of Skew-Symmetric or Symmetric Matrices, arXiv:1007.3807v1] Oum proved that, for a fixed finite field $\mathbf{F}$, any infinite sequence $M_1,M_2,...$ of (skew) symmetric matrices over $\mathbf{F}$ of…

A conjecture of Barrett, Butler and Hall may be stated as follows: If $n \geq 3$ and $A \in \{0,1\}^{n \times n}$ (the family of $n \times n$ 0--1 matrices) is a nonsingular symmetric matrix, then the following two statements are…