Arithmetical properties of combinatorial matrices

• Main Author: Verheiden, Eric Paul
• Format: Others
• Published: 1978
• Online Access: https://thesis.library.caltech.edu/2899/1/Verheiden_ep_1978.pdf; Verheiden, Eric Paul (1978) Arithmetical properties of combinatorial matrices. Dissertation (Ph.D.), California Institute of Technology. doi:10.7907/N7SA-NA13. https://resolver.caltech.edu/CaltechETD:etd-07162004-112552 <https://resolver.caltech.edu/CaltechETD:etd-07162004-112552>

NOTE: Text or symbols not renderable in plain ASCII are indicated by [...]. Abstract is included in .pdf document. Results are derived on rational solutions to [...] where B is integral and A need not be square. It is shown that in general, provided a rational solution exists, one can be found in which all denominators are a power of two. More general restrictions follow from the corresponding restrictions possible on rational lattices representing integral positive definite quadratic forms of determinant one. Results due to Kneser and others are applied to show that A may be taken as integral if it has no more than seven columns, half-integral if it has no more than sixteen columns. These results are then applied to three types of matrix completion problems, integral matrices satisfying [...], partial Hadamard matrices and partial incidence matrices of symmetric block designs. It is found that rational normal completing matrices in which all denominators are powers of two are always possible in the first two cases and almost always possible in the final case. Using a computer approach, the specific problem of showing that the last seven rows of a partial Hadamard matrix or a partial incidence matrix (with suitable parameters) can always be completed is tackled and it is shown that this is in fact the case, extending results by Marshall Hall for no more than four rows. An appendix lists the computer tabulation which is the basis of this conclusion.