Matrices and set differences
Let A and B be (0,1)-matrices of sizes m by t and t by n, respectively. Let \(x_ 1,...,x_ t\) denote t independent indeterminates over the rational field Q and define \(X=diag[x_ 1,...,x_ t]\). We study the matrix equation \(AXB=Y\). We first discuss its combinatorial significance relative to topics such as set intersections and the Marica-Schönheim theorem on set differences. We then prove the following theorem concerning the matrix Y. Suppose that the matrix Y of size m by n has rank m. Then Y contains m distinct nonzero elements, one in each of the m rows of Y.
- scientific article; zbMATH DE number 874510
- Concerning difference matrices
- Set matrices
- Discrepancy of set-systems and matrices
- On a difference matrix and its properties
- scientific article; zbMATH DE number 878919
- scientific article; zbMATH DE number 2152867
- Supplementary difference sets and Hadamard matrices
- Coordinate difference matrices
- A Fundamental Matrix Equation for Finite Sets
- A Marica-Schoenheim theorem for an infinite sequence of finite sets
- Analogs of a theorem of Schur on matrix transformations
- Differences of Sets and A Problem of Graham
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 3311772 (Why is no real title available?)
- Properties of (0,1)-matrices with no triangles
- Properties of (0,1)-matrices without certain configurations
- Set intersection matrices
- The Number of Values of a Boolean Function
- The Number of values of Combinatorial Functions
This page was built for publication: Matrices and set differences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790122)
