✦ LIBER ✦

Linearly independent set families

✍ Scribed by Friedhelm Eicker; Guenter Ewald

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 253 KB
Volume: 388
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2004.02.026

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On maximal t-linearly independent sets

✍ Bodh Raj Gulati; Bruce McK Johnson; Uwe Koehn 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 346 KB

On a geometrical method of construction

On a geometrical method of construction of maximal t-linearly independent sets

✍ Noboru Hamada; Fumikazu Tamari 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 648 KB

Independence number and the complexity o

Independence number and the complexity of families of sets

✍ D.Q. Naiman; H.P. Wynn 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 870 KB

A polynomial algorithm for constructing

A polynomial algorithm for constructing families of k-independent sets

✍ G. Freiman; E. Lipkin; L. Levitin 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 1003 KB

The present paper describes an algorithm for constructing families of k-independent subsets & of {1,2, . . . , n} with &I >2ck", where c, = d/(k -1)2& and d is a certain constant. The algorithm has a polynomial complexity with respect to the size of the family constructed.

Explicit construction of exponential siz

Explicit construction of exponential sized families of k-independent sets

✍ N Alon 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Error correcting codes are used to describe explicit collections Fk of subsets of {1, 2,... n}, with IFkl > 2 ckn (ck > 0), such that for any selections A, B of kl and k 2 of members of Fk with kl + k2 = k, there are elements in all the members of A and not in the members of B. This settles a proble

Linearly independent vertices and minimu

Linearly independent vertices and minimum semidefinite rank

✍ Philip Hackney; Benjamin Harris; Margaret Lay; Lon H. Mitchell; Sivaram K. Naray 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 457 KB

We study the minimum semidefinite rank of a graph using vector representations of the graph and of certain subgraphs. We present a sufficient condition for when the vectors corresponding to a set of vertices of a graph must be linearly independent in any vector representation of that graph, and conj