A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets (Q612909)

Summary: Recently, \textit{F. Eisenbrand, J. Pach, Th. Rothvoß} and \textit{N. B. Sopher} [Electron. J. Comb. 15, No.~1, Research Paper N8, 4~p. (2008; Zbl 1160.52013)] studied the function \(M (m, n)\), which is the largest cardinality of a convexly independent subset of the Minkowski sum of some planar point sets \(P\) and \(Q\) with \(|P| = m\) and \(|Q| = n\). They proved that \(M (m, n) = O(m^{2/3}n^{2/3} + m + n)\), and asked whether a superlinear lower bound exists for \(M (n, n)\). In this note, we show that their upper bound is the best possible apart from constant factors.