The balanced upper chromatic number of linear hypergraphs and the $n$-cube over $t$ elements
A coloring of the vertices of a hypergraph is called \emph{balanced} if the sizes of the color classes differ by at most one. We say that a hyperedge is \emph{rainbow} if its elements have pairwise distinct colors. In this paper, we provide a general upper bound on the \emph{balanced upper chromatic number} of arbitrary linear hypergraphs, that is, the largest integer $k$ such that there exists a balanced $k$-coloring of the vertices of the hypergraph without rainbow hyperedges. We focus on the cube $C_t^n$, defined as the linear hypergraph whose vertices are the lattice points in $[0,t-1]^n$, and whose hyperedges are the sets of $t$ collinear points. We determine the exact balanced upper chromatic number of $C_t^n$ for $t\geq 4n-2$. For smaller values of $t$, we present bounds and determine this parameter (with few exceptions) in dimensions $2$ and $3$.