✦ LIBER ✦

Strong unimodularity for matrices and hypergraphs

✍ Scribed by Yves Crama; Peter L. Hammer; Toshihide Ibaraki

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 776 KB
Volume: 15
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(86)90044-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Compound and unimodular matrices

✍ David P. Brown 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 560 KB

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

Unimodular Matrices and Parsons Numbers

✍ Aiden Bruen; David Wehlau; Zhang Zhaoji 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 185 KB

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 and Unimodular Latti

Conference Matrices and Unimodular Lattices

✍ Robin Chapman 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 147 KB

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.

The mod p Rank of Incidence Matrices for

The mod p Rank of Incidence Matrices for Connected Uniform Hypergraphs

✍ Anders Björner; Johan Karlander 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 151 KB

Anti-Hadamard Matrices, Coin Weighing, T

Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs

✍ Noga Alon; Văn H Vũ 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 435 KB

Let / 1 (n) denote the maximum possible absolute value of an entry of the inverse of an n by n invertible matrix with 0,1 entries. It is proved that / 1 (n)=n (1Â2+o(1)) n . This solves a problem of Graham and Sloane. Let m(n) denote the maximum possible number m such that given a set of m coins out

Nevanlinna matrices for the strong Stiel

Nevanlinna matrices for the strong Stieltjes moment problem

✍ Olav Njåstad 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 391 KB

Let {c,,}~ ~ be a doubly infinite sequence of real numbers. A solution of the strong Hamburger moment problem is a positive measure tr on (-~x~, c~) such that c, = f\_~ u ~ da(u) for n = 0, ± 1, i 2 ..... A solution of the strong Stieltjes moment problem is a positive measure a on [0, c~z) such that