An algorithm for nontransitive partitions (Q1636938): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4171/em/348 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2782567240 / rank | |||
Normal rank | |||
Latest revision as of 09:22, 30 July 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
