if P is any square unimodular matrax of order n. it is proven that the n .-f coqwund of ,fJ, pw U, is unimodular. If P is rectangular of order n x +I. unimodular matrices c~f t)rder k + I lln PC" are chatact&ted. A sign rule for P"', n 5 I:I, Is estabiished. fat certain pairs of rows in P"". ahe pro
Circuit and Unimodular Matrices
โ Scribed by Brown, David P.
- Book ID
- 118191836
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 1976
- Tongue
- English
- Weight
- 625 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0036-1399
- DOI
- 10.1137/0131040
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let [A 1 , ..., A m ] be a set of m matrices of size n\_n over the field F such that A i # SL(n, F) for 1 i m and such that A i &A j # SL(n, F) for 1 i< j m. The largest integer m for which such a set exists is called the Parsons number for n and F, denoted m(n, F). We will call such a set of m(n, F
Conference matrices are used to define complex structures on real vector spaces. Certain lattices in these spaces become modules for rings of quadratic integers. Multiplication of these lattices by nonprincipal ideals yields simple constructions of further lattices including the Leech lattice.
## Abstract Conditions for a matrix to be totally unimodular, due to Camion, are applied to extend and simplify proofs of other characterizations of total unimodularity.