A lower bound for weak Schur numbers with a deterministic algorithm

DOI10.1016/j.jda.2018.10.002zbMath1414.05033OpenAlexW2900940559MaRDI QIDQ1757462

Arpad Rimmel, Ghada Ben Hassine, Pierre Bergé, Joanna Tomasik

Publication date: 4 January 2019

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2018.10.002

zbMATH Keywords

Monte Carlo methodweak Schur numbersweak sum-free partitions

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Combinatorial aspects of partitions of integers (05A17) Other combinatorial number theory (11B75)

Cites Work

• Weak Schur numbers and the search for G. W. Walker's lost partitions
• On an extension of a theorem of Schur
• The Tower of Hanoi – Myths and Maths
• On stirling numbers of the second kind
• Unnamed Item

This page was built for publication: A lower bound for weak Schur numbers with a deterministic algorithm