Pages that link to "Item:Q309640"

The following pages link to The maximum number of faces of the Minkowski sum of two convex polytopes (Q309640):

Displaying 20 items.

• The maximum number of faces of the Minkowski sum of two convex polytopes (Q309640) (← links)
• The flag polynomial of the Minkowski sum of simplices (Q368451) (← links)
• Maximal f-vectors of Minkowski sums of large numbers of polytopes (Q411394) (← links)
• Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums (Q507686) (← links)
• A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets (Q612909) (← links)
• A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes (Q728499) (← links)
• A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q831714) (← links)
• A linear equation for Minkowski sums of polytopes relatively in general position (Q966166) (← links)
• Topological obstructions for vertex numbers of Minkowski sums (Q1003631) (← links)
• The Minkowski sum of a simple polygon and a segment (Q1007520) (← links)
• On the exact maximum complexity of Minkowski sums of polytopes (Q1042457) (← links)
• Convexly independent subsets of Minkowski sums of convex polygons (Q2032897) (← links)
• \(f\)-vectors of Minkowski additions of convex polytopes (Q2369928) (← links)
• Log-Concavity and Lower Bounds for Arithmetic Circuits (Q2946406) (← links)
• The maximum number of faces of the Minkowski sum of three convex polytopes (Q2970414) (← links)
• (Q5111020) (← links)
• Almost Simplicial Polytopes: The Lower and Upper Bound Theorems (Q5222174) (← links)
• (Q5743374) (redirect page) (← links)
• Sharp Bounds for the Number of Regions of Maxout Networks and Vertices of Minkowski Sums (Q5886829) (← links)
• A worst-case optimal algorithm to compute the Minkowski sum of convex polytopes (Q6126717) (← links)