Vector Partition Functions and Hyperplanes (problem 4)
Statement
onsider the vector partition function. \begin{itemize} \item How many pieces are there? This is known for , and there is known lower bound of . \item Understand why some polynomials factor nicely over the arrangement.
\item Consider $q$-analogues. In particular, the $q$ version of $(1,2,3,\cdots)$ is conjectured to grow at $e^{\theta(n^2)}$.
\end{itemize}
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.