Finite Beatty blocks and balanced gap words
Statement
Problem 1.14 (R. Graham). Instead of k-term arithmetic progressions, one could consider a more flexible structure, namely weak k-term arithmetic progressions, which are sets of the form
{b nα + βc: 1 ≤ n ≤ k} (for some α ≥ 1 and β).
Since there are substantially more weak k-term arithmetic progressions than k-term arithmetic progressions, some of the standard problems and results might be easier to attack.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.