Partial order on a family of \(k\)-subsets of a linearly ordered set (Q2368930)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5020344
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partial order on a family of \(k\)-subsets of a linearly ordered set |
scientific article; zbMATH DE number 5020344 |
Statements
Partial order on a family of \(k\)-subsets of a linearly ordered set (English)
0 references
28 April 2006
0 references
For \(k\)-subsets \(A\) and \(B\) of the rationals, define \(A\, Rn\, B\) if \(a R b\) holds for at least \(n\) ordered pairs \((a, b)\) in \(A\, \times \, B\), where \(k\) and \(n\) are integers bounded between \(1\) and \(kk\). The paper shows that the relation \(Rn\) is transitive if and only if \(k(k - 1) + 1\) is less than \(n + 1\), and that there is a cyclic sequence of \(k\)-subsets of the rationals if and only if \(n\) is bounded between \(1\) and \(kk - (k + 1)(k + 1)/4\). The paper also considers the length of such cyclic sequences.
0 references
transitivity
0 references
cyclic sequence
0 references
acyclic digraph
0 references
0.8995612
0 references
0.89810663
0 references
0.8969919
0 references
0 references
0.89448106
0 references
0.89278513
0 references
0.89019597
0 references