Building matrices with prescribed size and number of invertible submatrices

DOI10.1016/J.EJC.2019.103016MaRDI QIDQ2011135zbMATH OpenOpenAlexFDO

Authors Edward S. T. Fan, Tony W. H. Wong

Publication date 28 November 2019

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.6048

zbMATH Keywords

representable matroidslinear matroidscolumn matroids

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of matroids and geometric lattices (05B35)

Abstract: Given an ordered triple of positive integers $(n,r,b)$, where $$, does there exist a matrix of size $rimesn$ with exactly $b$ invertible submatrices of size $rimesr$? Such a matrix is called an $(n,r,b)$-matrix. This question is a stronger version of an open problem in matroid theory raised by Dominic Welsh. In this paper, we prove that an $(n,r,b)$-matrix exists when the corank satisfies $n-rleq3$, unless $(n,r,b)=(6,3,11)$. Furthermore, we show that an $(n,r,b)$-matrix exists when the rank $r$ is large relative to the corank $n-r$.

Recommendations

• On Rota's problem about n bases in a rank n matroid
• Matroids and the minimum rank problem for matrix patterns
• Matrices with forbidden subconfigurations
• Singular (0,1) matrices with constant row and column sums
• ON THE MAXIMAL RANK IN A SUBSPACE OF MATRICES

Cites work

• scientific article; zbMATH DE number 3368629 (Why is no real title available?)
• Matroids with nine elements

This page was built for publication: Building matrices with prescribed size and number of invertible submatrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011135)