Maximal midpoint-free subsets of integers (Q274755)

Summary: A set \(S \subset \mathbb{Z}\) is midpoint-free if no ordered triple \((a, b, c) \in S^3\) satisfies \(a + c = 2b\) and \(a < b < c\). Midpoint-free subsets of \(\mathbb{Z}^+\) and \(\mathbb{Z}\) are studied, with emphasis on those sets characterized by restrictions on the base \(m\) digits of their elements when \(3 \le m \le 14\), and with particular attention to maximal midpoint-free subsets with \(m \in \{3, 4, 7, 9, \ldots, 13\}\).