A cascade proof of a finite vectors theorem

MaRDI QIDQ1377374zbMATH OpenFDO

Authors David E. Daykin

Publication date 4 February 1998

Published in Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

zbMATH Keywords

Danh-Daykin theoremDaykin's cascade algorithmfinite vectorsshadow

Mathematics Subject Classification ID

Enumerative combinatorics (05A99)

Review text

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.

Recommendations

• Shadows and intersections in vector spaces
• scientific article; zbMATH DE number 1176654
• scientific article; zbMATH DE number 881177

Cited in

(2)

• A Vector Proof of a Theorem of Bang
• A simple proof of Feuerbach's theorem with coordinate free vectors

This page was built for publication: A cascade proof of a finite vectors theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377374)