The arithmetic-progression partition heaviness conjecture

From papers

For positive integers i,s,ki,s,k, let i+(k1)s,,i+s,i\llbracket i+(k-1)s,\ldots,i+s,i\rrbracket denote the partition whose parts form a decreasing arithmetic progression with initial part i+(k1)si+(k-1)s, common difference ss, and final part ii. A partition is heavy if it has the heaviness property defined for partitions in the paper. Arithmetic-progression partition heaviness conjecture. If ii, ss, and kk are positive integers, then

i+(k1)s,,i+s,i\llbracket i+(k-1)s,\ldots,i+s,i\rrbracket

is heavy. This proposes a further infinite family of heavy partitions, motivated by the patterns observed in the paper; the source gives no proof or resolution.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Eric Gottlieb, Matjaž Krnc and Peter Muršič, “Nim on Integer Partitions and Hyperrectangles”, arXiv:2506.04991 (2025).

Solutions 0

No solutions have been posted yet.