Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 80 tok/s
Gemini 2.5 Pro 60 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 87 tok/s Pro
Kimi K2 173 tok/s Pro
GPT OSS 120B 433 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Shellability of the higher pinched Veronese posets (1305.3159v4)

Published 14 May 2013 in math.CO and math.AC

Abstract: The pinched Veronese poset $V*_n$ is the poset with ground set consisting of all non-negative integer vectors of length n such that the sum of their coordinates is divisible by $n$ with exception of the vector $(1,...,1)$. For two vectors $a$ and $b$ in $V*_n$ we have $a \leq b$ if and only if $b - a$ belongs to the ground set of $V*_n$. We show that every interval in $V*_n$ is shellable for $n$ at least 4. In order to obtain the result, we develop a new method for showing that a poset is shellable. This method differs from classical lexicographic shellability. Shellability of intervals in $V*_n$ has consequences in commutative algebra. As a corollary we obtain a combinatorial proof of the fact that the pinched Veronese ring is Koszul for $n \geq 4$. (This also follows from a result by Conca, Herzog, Trung and Valla.)

Summary

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

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

Collections

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