Back to Search
Start Over
Union of shadows
- Source :
-
Theoretical Computer Science . Oct2003, Vol. 307 Issue 3, p493. 10p. - Publication Year :
- 2003
-
Abstract
- Our aim in this note is to show that if <f>A</f> is a family of <f>(<NU>k</NU>/3</fr>)</f> 3-sets then there are at least <f>(<fr style="bl" shape="case" ALIGN="C"><NU>k</NU>/4)</f> 3-sets then there are at least <f>(<NU>k</NU>/4)</f> 4-sets that may be written as unions of two 2-sets in the shadow of <f>A</f>. This is the first non-trivial case of a more general conjecture about unions of shadows. [Copyright &y& Elsevier]
- Subjects :
- *SHADES & shadows
*LOGICAL prediction
*SET theory
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 307
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 11001033
- Full Text :
- https://doi.org/10.1016/S0304-3975(03)00233-0