A lower bound for weak Schur numbers with a deterministic algorithm

Journal of Discrete Algorithms - Tập 51 - Trang 12-25 - 2018
Ghada Ben Hassine1, Pierre Bergé1, Arpad Rimmel2, Joanna Tomasik2
1CentraleSupélec, Université Paris-Saclay, 3 rue Joliot-Curie, 91190 Gif-sur-Yvette, France
2LRI, CentraleSupélec, Université Paris-Saclay, LRI, Bât. 650, 91405 Orsay, France

Tài liệu tham khảo

Bornsztein, 2002, On an extension of a theorem of Schur, Acta Math., 101, 395 Bouzy, 2015 Eliahou, 2013, Investigating Monte-Carlo methods on the weak Schur problem, 191 Eliahou, 2012, Weak Schur numbers and the search for G.W. Walker's lost partitions, Comput. Math. Appl., 63, 175, 10.1016/j.camwa.2011.11.006 Hinz, 2013 Rennie, 1969, On Stirling numbers of the second kind, J. Comb. Theory, 7, 116, 10.1016/S0021-9800(69)80045-1 Robilliard, 2011, A multilevel tabu search with backtracking for exploring weak schur numbers, vol. 7401, 109 Schur, 1917, Über die Kongruenz xm+ym≡zm (mod. p), Jahresber. Dtsch. Math.-Ver., 25, 114 Sierpiński, 1964, Elementary Theory of Numbers, vol. 42 Walker, 1952, A problem in partitioning, Am. Math. Mon., 52, 253