On the support size of null designs of finite ranked posets

DOI10.1007/S004939970009zbMATH Open0949.05006OpenAlexW2036059333MaRDI QIDQ1586352FDOQ1586352

Authors: Soojin Cho 

Publication date: 13 November 2000

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004939970009

Recommendations

• Minimal null designs and a density theorem of posets
• Intersection theorems and mod \(p\) rank of inclusion matrices
• scientific article; zbMATH DE number 1373451
• A NOTE ON NULL DESIGNS OF DUAL POLAR SPACES
• POLYTOPES OF MINIMAL NULL DESIGNS

zbMATH Keywords

posetnull \(t\)-design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorics of partially ordered sets (06A07) Extremal combinatorics (05D99)

Cited In (10)

• Minimum supports of functions on the Hamming graphs with spectral constraints
• Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
• The minimum volume of subspace trades
• Minimum supports of eigenfunctions of Johnson graphs
• Optimal functions with spectral constraints in hypercubes
• Inclusion matrices for rainbow subsets
• On the cardinality spectrum and the number of Latin bitrades of order 3
• Minimum supports of eigenfunctions in bilinear forms graphs
• Minimum supports of eigenfunctions of graphs: a survey
• A NOTE ON NULL DESIGNS OF DUAL POLAR SPACES

This page was built for publication: On the support size of null designs of finite ranked posets

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