A cascade proof of a finite vectors theorem (Q1377374)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1112723
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cascade proof of a finite vectors theorem |
scientific article; zbMATH DE number 1112723 |
Statements
A cascade proof of a finite vectors theorem (English)
0 references
4 February 1998
0 references
The purpose of this note is to give a new proof of the Danh-Daykin theorem which finds the best possible lower bound for the shadow of a set which is a subset of an \(n\)-dimensional binary e.g. \(0\), \(1\) vector space. The proof is based on Daykin's cascade algorithm.
0 references
finite vectors
0 references
Danh-Daykin theorem
0 references
shadow
0 references
Daykin's cascade algorithm
0 references
0.6925680041313171
0 references
