On the support size of null designs of finite ranked posets (Q1586352): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:10, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the support size of null designs of finite ranked posets |
scientific article |
Statements
On the support size of null designs of finite ranked posets (English)
0 references
13 November 2000
0 references
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.
0 references
poset
0 references
null \(t\)-design
0 references