Related papers: $2$-Modular Matrices

We show that a matrix is a Hermitian positive semidefinite matrix whose nonzero entries have modulus 1 if and only if it similar to a direct sum of all $1's$ matrices and a 0 matrix via a unitary monomial similarity. In particular, the only…

A $\mathbb{Z}^d$-graded differential $R$-module is a $\mathbb{Z}^d$-graded $R$-module $D$ equipped with an endomorphism, $\delta$, that squares to zero. For $R=k[x_1,\ldots,x_d]$, this paper establishes a lower bound on the rank of such a…

We describe the set of maximal orders in a 2-by-2 matrix algebra over a non-commutative local division algebra B containing a given suborder, for certain important families of such suborders, including rings of integers of division…

Modular data is an important topic of study in rational conformal field theory. A modular datum defines finite dimensional representations of the modular group $\mbox{SL}_2(\mathbf{Z})$. For every Fourier matrix in a modular datum there…

We propose necessary and sufficient conditions for an integer matrix to be decomposable in terms of its Hermite normal form. Specifically, to each integer matrix of maximal row rank without columns of zeros, we associate a symmetric whole…

We introduce the class E2 (resp. SE2) of commutative rings R with the property that each unimodular 2 x 2 matrix with entries in R extends to an invertible 3 x 3 matrix (resp. invertible 3 x 3 matrix whose (3, 3) entry is 0). Among…

The forbidden number $\mathrm{forb}(m,F)$, which denotes the maximum number of unique columns in an $m$-rowed $(0,1)$-matrix with no submatrix that is a row and column permutation of $F$, has been widely studied in extremal set theory.…

Let $R$ and $S$ be two sequences of nonnegative integers in nonincreasing order and with the same sum, and let ${\cal A}(R,S)$ be the class of all $(0,1)$-matrices having row sum $R$ and column sum $S$. For a positive integer $t$, the…

We prove that the maximum determinant of an $n \times n $ matrix, with entries in $\{0,1\}$ and at most $n+k$ non-zero entries, is at most $2^{k/3}$, which is best possible when $k$ is a multiple of 3. This result solves a conjecture of…

We investigate the existence of heavy columns in binary matrices with distinct rows. A column of an m x n binary matrix is called heavy if the number of ones in it is at least m/2. We introduce two recursive algorithms, A1 and A2, that…

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…

Let $R$ be an affine algebra over an algebraically closed field of characteristic $0$ with dim$(R)=n$. Let $P$ be a projective $A=R[T_1,\cdots,T_k]$-module of rank $n$ with determinant $L$. Suppose $I$ is an ideal of $A$ of height $n$ such…

We study ranks of the $r\textrm{th}$ Hadamard powers of doubly nonnegative matrices and show that the matrix $A^{\circ r}$ is positive definite for every $n\times n$ doubly nonnegative matrix $A$ and for every $r>n-2$ if and only if no…

Let $R$ be a finite local ring of odd characteristic and $\beta$ a non-degenerate symmetric bilinear form on $R^2$. In this short note, we determine the largest possible cardinality of pairwise orthogonal sets of unimodular vectors in…

Consider the special linear group of degree $2$ over an arbitrary finite field, acting on the full space of $2 \times 2$-matrices by transpose. We explicitly construct a generating set for the corresponding modular matrix invariant ring,…

Determining the matrix multiplication exponent $\omega$ is one of the greatest open problems in theoretical computer science. We show that it is impossible to prove $\omega = 2$ by starting with structure tensors of modules of fixed degree…

A nonnegative tensor has nonnegative rank at most 2 if and only if it is supermodular and has flattening rank at most 2. We prove this result, then explore the semialgebraic geometry of the general Markov model on phylogenetic trees with…

For t a positive integer, the t-term rank of a (0,1)-matrix A is defined to be the largest number of 1s in A with at most one 1 in each column and at most t 1s in each row. Thus the 1-term rank is the ordinary term rank. We generalize some…

Two matrices with elements taken from the set {-1,1} are Hadamard equivalent if one can be converted into the other by a sequence of permutations of rows and columns, and negations of rows and columns. In this paper we summarize what is…

For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…