Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 82 tok/s
Gemini 2.5 Pro 43 tok/s Pro
GPT-5 Medium 30 tok/s
GPT-5 High 32 tok/s Pro
GPT-4o 95 tok/s
GPT OSS 120B 469 tok/s Pro
Kimi K2 212 tok/s Pro
2000 character limit reached

Shard polytopes (2007.01008v2)

Published 2 Jul 2020 in math.CO

Abstract: For any lattice congruence of the weak order on permutations, N. Reading proved that gluing together the cones of the braid fan that belong to the same congruence class defines a complete fan, called a quotient fan, and V. Pilaud and F. Santos showed that it is the normal fan of a polytope, called a quotientope. In this paper, we provide a simpler approach to realize quotient fans based on Minkowski sums of elementary polytopes, called shard polytopes, which have remarkable combinatorial and geometric properties. In contrast to the original construction of quotientopes, this Minkowski sum approach extends to type $B$.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.