Related papers: On 0--1 matrices whose inverses have entries of th…
We study {\em sign-restricted matrices} (SRMs), a class of rectangular $(0, \pm 1)$-matrices generalizing the alternating sign matrices (ASMs). In an SRM each partial column sum, starting from row 1, equals 0 or 1, and each partial row sum,…
Consider a random $n\times m$ matrix $A$ over the finite field of order $q$ where every column has precisely $k$ nonzero elements, and let $M[A]$ be the matroid represented by $A$. In the case that q=2, Cooper, Frieze and Pegden (RS\&A…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…
Let $M_n$ be drawn uniformly from all $\pm 1$ symmetric $n \times n$ matrices. We show that the probability that $M_n$ is singular is at most $\exp(-c(n\log n)^{1/2})$, which represents a natural barrier in recent approaches to this…
We prove that given any $\epsilon>0$, random integral $n\times n$ matrices with independent entries that lie in any residue class modulo a prime with probability at most $1-\epsilon$ have cokernels asymptotically (as $n\rightarrow\infty$)…
The \textit{sepr-sequence} of an $n\times n$ real matrix $A$ is $(s_1,\ldots,s_n)$, where $s_k$ is the subset of those signs of $+,-,0$ that appear in the values of the $k\times k$ principal minors of $A$. The $12\times 12$ matrix…
We prove the conjecture by Damm and Fassbender that, for any pair $L,M$ of real traceless matrices, there exists an orthogonal $V$ such that $V^{-1} L \, V$ is hollow and $V M V^{-1}$ is almost hollow, where a matrix is hollow if and only…
Bidiagonal matrices are widespread in numerical linear algebra, not least because of their use in the standard algorithm for computing the singular value decomposition and their appearance as LU factors of tridiagonal matrices. We show that…
A diagonally symmetric alternating sign matrix (DSASM) is a symmetric matrix with entries $-1$, $0$ and $1$, where the nonzero entries alternate in sign along each row and column, and the sum of the entries in each row and column equals…
A hollow matrix is a square matrix whose diagonal entries are all equal to zero. Define $\lambda^* = \rho^{1/2} + \rho^{-1/2} \approx 2.01980$, where $\rho$ is the unique real root of $x^3 = x + 1$. We show that for every $\lambda <…
Consider rectangular matrices over a commutative ring R. Assume the ideal of maximal minors factorizes, I_m(A)=J_1*J_2. When is A left-right equivalent to a block-diagonal matrix? (When does the module/sheaf Coker(A) decompose as the…
A generalized tournament matrix $M$ is a nonnegative matrix that satisfies $M+M^{t}=J-I$, where $J$ is the all ones matrix and $I$ is the identity matrix. In this paper, a characterization of generalized tournament matrices with the same…
In this paper we announce a conjecture concerning enumeration of n-times persymmetric matrices over F_2 by rank. To justify our statement we remark that the formulas obtained are valid for n equal to one, two and three.
Suppose $\mathbb{F}$ is a field and let $\mathbf{a} := (a_1, a_2, \dotsc)$ be a sequence of non-zero elements in $\mathbb{F}$. For $\mathbf{a}_n := (a_1, \dotsc, a_n)$, we consider the family $\mathcal{M}_n(\mathbf{a})$ of $n \times n$…
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 consider the alternating sign matrices of the odd order that have some kind of central symmetry. Namely, we deal with matrices invariant under the half-turn, quarter-turn and flips in both diagonals. In all these cases, there are two…
We consider $n\times n$ real-valued matrices $A = (a_{ij})$ satisfying $a_{ii} \geq a_{i,i+1} \geq \dots \geq a_{in} \geq a_{i1} \geq \dots \geq a_{i,i-1}$ for $i = 1,\dots,n$. With such a matrix $A$ we associate a directed graph $G(A)$. We…
Recently, Kenyon and Wilson introduced a certain matrix $M$ in order to compute pairing probabilities of what they call the double-dimer model. They showed that the absolute value of each entry of the inverse matrix $M^{-1}$ is equal to the…
Let $A\in\mathbb{R}^{n\times n}$ be a random matrix with independent entries, and suppose that the entries are "uniformly anticoncentrated" in the sense that there is a constant $\varepsilon>0$ such that each entry $a_{ij}$ satisfies…
An integer-valued matrix $\mathbf{A}$ is $\Delta$-modular if each $\text{rank}(\mathbf{A}) \times \text{rank}(\mathbf{A})$ submatrix has determinant at most $\Delta$ in absolute value. The column number problem is to determine the maximum…