An algorithm for nontransitive partitions (Q1636938): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 05:10, 5 March 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
