An algorithm for nontransitive partitions (Q1636938): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:55, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for nontransitive partitions |
scientific article |
Statements
An algorithm for nontransitive partitions (English)
0 references
7 June 2018
0 references
The author presents a new algorithm which produces a basic nontransitive partition of the set \(\{1,2,\dots,(2n+1)^2\}\) with the Laplace probability equals to \(\frac{2n^2+3n}{(2n+1)^2}\).
0 references
nontransitive partitions
0 references
