Let P=P_1+⋯+P_n be the Minkowski sum of convex d-polytopes, and let v_i=f_0(P_i) be the number of vertices of P_i.
Statement
Let P=P_1+⋯+P_n be the Minkowski sum of convex d-polytopes, and let v_i=f_0(P_i) be the number of vertices of P_i. Determine the tight upper bounds for every face number f_k(P), 0≤k≤d−1, in terms of v_1,…,v_n.
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.