An algorithm for nontransitive partitions

DOI10.4171/EM/348MaRDI QIDQ1636938zbMATH OpenOpenAlexFDO

Authors Robert Brawer

Publication date 7 June 2018

Published in Elemente der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4171/em/348

zbMATH Keywords

nontransitive partitions

Mathematics Subject Classification ID

Partitions of sets (05A18)

Review text

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}\).

Cited in

(8)

• An algorithm for partitioning a set into simple parts
• Two algorithms for general list matrix partitions
• A Simple SVD Algorithm for Finding Hidden Partitions
• On the uniform distribution modulo 1 of multidimensional LS-sequences
• Horizontal partitions and Kleshchev's algorithm
• scientific article; zbMATH DE number 1439398 (Why is no real title available?)
• ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
• scientific article; zbMATH DE number 5492159 (Why is no real title available?)

This page was built for publication: An algorithm for nontransitive partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1636938)