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 33 tok/s
Gemini 2.5 Pro 51 tok/s Pro
GPT-5 Medium 24 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 74 tok/s Pro
Kimi K2 188 tok/s Pro
GPT OSS 120B 362 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Chains of modular elements and shellability (1104.0936v3)

Published 5 Apr 2011 in math.CO and math.GR

Abstract: Let L be a lattice admitting a left-modular chain of length r, not necessarily maximal. We show that if either L is graded or the chain is modular, then the (r-2)-skeleton of L is vertex-decomposable (hence shellable). This proves a conjecture of Hersh. Under certain circumstances, we can find shellings of higher skeleta. For instance, if the left-modular chain consists of every other element of some maximum length chain, then L itself is shellable. We apply these results to give a new characterization of finite solvable groups in terms of the topology of subgroup lattices. Our main tool relaxes the conditions for an EL-labeling, allowing multiple ascending chains as long as they are lexicographically before non-ascending chains. We extend results from the theory of EL-shellable posets to such labelings. The shellability of certain skeleta is one such result. Another is that a poset with such a labeling is homotopy equivalent (by discrete Morse theory) to a cell complex with cells in correspondence to weakly descending chains.

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.