An inequality in binary vector spaces

A.E. Brouwer

doi:10.1016/0012-365X(86)90177-9

An inequality in binary vector spaces

A.E. Brouwer

Research output: Contribution to journal › Article › Academic › peer-review

1 Citation (Scopus)

Abstract

We prove that if an n-dimensional vector space over GF(2) is the irredundant union of k subspaces, and this collection of subspaces has zero intersection, then n>k. This settles a conjecture by G. Bruns.

Original language	English
Pages (from-to)	315-317
Journal	Discrete Mathematics
Volume	59
Issue number	3
DOIs	https://doi.org/10.1016/0012-365X(86)90177-9
Publication status	Published - 1986

Access to Document

10.1016/0012-365X(86)90177-9

Cite this

@article{46fb16d09cae433a908a9176a67e720a,

title = "An inequality in binary vector spaces",

abstract = "We prove that if an n-dimensional vector space over GF(2) is the irredundant union of k subspaces, and this collection of subspaces has zero intersection, then n>k. This settles a conjecture by G. Bruns.",

author = "A.E. Brouwer",

year = "1986",

doi = "10.1016/0012-365X(86)90177-9",

language = "English",

volume = "59",

pages = "315--317",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - An inequality in binary vector spaces

AU - Brouwer, A.E.

PY - 1986

Y1 - 1986

N2 - We prove that if an n-dimensional vector space over GF(2) is the irredundant union of k subspaces, and this collection of subspaces has zero intersection, then n>k. This settles a conjecture by G. Bruns.

AB - We prove that if an n-dimensional vector space over GF(2) is the irredundant union of k subspaces, and this collection of subspaces has zero intersection, then n>k. This settles a conjecture by G. Bruns.

U2 - 10.1016/0012-365X(86)90177-9

DO - 10.1016/0012-365X(86)90177-9

M3 - Article

VL - 59

SP - 315

EP - 317

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 3

ER -

An inequality in binary vector spaces

Abstract

Access to Document

Fingerprint

Cite this