Complexity of sign imbalance, parity of linear extensions, and height 2 posets
Abstract
Sign imbalance is a statistic on posets which counts the difference between the number of even and odd linear extensions. We prove complexity results about the sign imbalance and parity of linear extensions, focusing on the representative case of height 2 posets. We then consider a recent conjecture of Chan and Pak.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.