We construct pseudorandom generators for combinatorial shapes, which substantially generalize combinatorial rectangles, small-bias spaces, 0/1 halfspaces, and 0/1 modular sums. A function f:[m]^n \rightarrow \{0,1\}^n is an (m,n)-combinatorial shape if there exist sets A_1,\ldots,A_n \subseteq [m] and a symmetric function h:\{0,1\}^n \rightarrow \{0,1\} such that f(x_1,\ldots,x_n) = h(1_{A_1} (x_1),\ldots,1_{A_n}(x_n)). Our ... more >>>