2000 character limit reached
Hodge Theory for Polymatroids (2105.04214v2)
Published 10 May 2021 in math.AG and math.CO
Abstract: We construct a Leray model for a discrete polymatroid with arbitrary building set and we prove a generalized Goresky-MacPherson formula. The first row of the model is the Chow ring of the polymatroid; we prove Poincar\'e duality, Hard Lefschetz, and Hodge-Riemann theorems for the Chow ring. Furthermore we provide a relative Lefschetz decomposition with respect to the deletion of an element.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.