Related papers: The column number for 3-modular matrices

We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…

Motivated by recent works on statistics of matrices over sets of number theoretic interest, we study matrices with entries from arbitrary finite subsets $\mathcal A$ of finite rank multiplicative groups infields of characteristic zero. We…

In the first section of this paper we prove a theorem for the number of columns of a rectangular area that are identical to the given one. In the next section we apply this theorem to derive several combinatorial identities by counting…

We study $m \times n$ matrices whose columns are of the form \[\{(a_{1j},\ldots, a_{nj}): \quad a_{1j} = \lambda_j,\ a_{ij} = \pm\lambda_j\ , \ \lambda_j >0 ,\ j=1,2,\ldots,n\}.\] We explicitly construct for all $a = (a_1,\ldots,…

A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important special case thereof are congruency-constrained integer programs…

Given a right-angled triangle of squares in a grid whose horizontal and vertical sides are $n$ squares long, let N(n) denote the maximum number of dots that can be placed into the cells of the triangle such that each row, each column, and…

We study the problem of finding a maximum-cardinality set of $r$-cliques in an undirected graph of fixed maximum degree $\Delta$, subject to the cliques in that set being either vertex-disjoint or edge-disjoint. It is known for $r=3$ that…

Maximizing monotone submodular functions under a matroid constraint is a classic algorithmic problem with multiple applications in data mining and machine learning. We study this classic problem in the fully dynamic setting, where elements…

We construct simple, explicit matrices with columns having unit $\ell^2$ norm and discrepancy approaching $1 + \sqrt{2} \approx 2.414$. This number gives a lower bound, the strongest known as far as we are aware, on the constant appearing…

Let $A \in Z^{m \times n}$, $rank(A) = n$, $b \in Z^m$, and $P$ be an $n$-dimensional polyhedron, induced by the system $A x \leq b$. It is a known fact that if $F$ is a $k$-face of $P$, then there exist at least $n-k$ linearly independent…

Let us extend the pair of operations (max,+) over real numbers to matrices in the same way as in conventional linear algebra. We study integer images of max-plus linear mappings. The question whether Ax (in the max-plus algebra) is an…

In this paper we find a third order unimodular matrix, none of whose entries is $1$ or $-1$, such that when each entry of the matrix is replaced by its cube, the resulting matrix is also unimodular. Further, we find third order square…

We formulate conjectures regarding the maximum value and maximizing matrices of the permanent and of diagonal products on the set of stochastic matrices with bounded rank. We formulate equivalent conjectures on upper bounds for these…

This paper considers the matrix completion problem. We show that it is not necessary to assume joint incoherence, which is a standard but unintuitive and restrictive condition that is imposed by previous studies. This leads to a sample…

We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…

Donald Knuth recently introduced the notion of a Baxter matrix, generalizing Baxter permutations. We show that for fixed number of rows, $r$, the number of Baxter matrices with $r$ rows and $k$ columns eventually satisfies a polynomial in…

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…

We estimate the frequency of singular matrices and of matrices of a given rank whose entries are parametrised by arbitrary polynomials over the integers and modulo a prime $p$. In particular, in the integer case, we improve a recent bound…

We revisit the class of column competent matrices and study some matrix theoretic properties of this class. The local $w$-uniqueness of the solutions to the linear complementarity problem can be identified by the column competent matrices.…

Design matrices are sparse matrices in which the supports of different columns intersect in a few positions. Such matrices come up naturally when studying problems involving point sets with many collinear triples. In this work we consider…