Minimum shadows in uniform hypergraphs and a generalization of the Takagi function (Q1344233)

For \(0 \leq x \leq 1\), \(S_ k (x)\) is the relative size of the shadow family of the first \(x{2k - 1 \choose k}\) \(k\)-element sets in the colex order. It is shown that \(S_ k (x)\) uniformly converges to the Takagi function, a well-known example of a nowhere differentiable continuous function. A generalization is given for the \(ck\)-shadow if \(0 < c < 1\) is fixed.