On the support size of null designs of finite ranked posets
From MaRDI portal
(Redirected from Publication:1586352)
Given two ranks \(t \leq k\) of a finite ranked partially ordered set \(P\), it is possible to define a \(0,1\) matrix, called adjacency matrix, with columns indexed by the elements of rank \(k\) and the rows indexed by the elements of rank \(t\). The kernel of this matrix forms a space. The author considers the space of null \(t\)-designs of finite ranked posets, and the number of non-zero entries of non-zero null \(t\)-designs.
Recommendations
Cited in
(11)- Minimal null designs and a density theorem of posets
- Minimum supports of eigenfunctions of Johnson graphs
- Minimum supports of functions on the Hamming graphs with spectral constraints
- On the cardinality spectrum and the number of Latin bitrades of order 3
- Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
- The minimum volume of subspace trades
- Minimum supports of eigenfunctions in bilinear forms graphs
- A NOTE ON NULL DESIGNS OF DUAL POLAR SPACES
- Minimum supports of eigenfunctions of graphs: a survey
- Optimal functions with spectral constraints in hypercubes
- Inclusion matrices for rainbow subsets
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)