On the Support Size of Null Designs of Finite Ranked Posets

t

-designs of the lattice of subspaces of a vector space over a finite field. The lower bound we find gives the tight bound for many important posets including the Boolean algebra, the lattice of subspaces of a vector space over a finite field, whereas the idea of the proofs of the main theorems makes it possible to prove that the lower bounds in the main theorems are not tight for some posets.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received: November 7, 1995

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Cho, S. On the Support Size of Null Designs of Finite Ranked Posets. Combinatorica 19, 589–595 (1999). https://doi.org/10.1007/s004939970009

Download citation

  • AMS Subject Classification (1991) Classes:  05B99, 05D99, 06A07