An algorithm for nontransitive partitions (Q1636938)

From MaRDI portal
Revision as of 14:34, 24 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    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
    0 references
    nontransitive partitions
    0 references

    Identifiers