2000 character limit reached
The structure of the Boij-Söderberg posets
Published 10 Jun 2010 in math.CO | (1006.2026v1)
Abstract: Boij and S\"oderberg made a pair of conjectures, which were subsequently proven by Eisenbud and Schreyer and then extended by Boij and S\"oderberg, about the structure of Betti diagrams of Graded modules. In the theory, a particular family of posets, and their associated order complexes, play an integral role. We explore the structure of this family. In particular, we show the posets are bounded complete lattices and the order complexes are vertex-decomposable, hence Cohen-Macaulay and squarefree glicci.
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.