Complexity of sign imbalance, parity of linear extensions, and height 2 posets
Combinatorics
2023-11-07 v1
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.
Keywords
Cite
@article{arxiv.2311.02203,
title = {Complexity of sign imbalance, parity of linear extensions, and height 2 posets},
author = {David Soukup},
journal= {arXiv preprint arXiv:2311.02203},
year = {2023}
}
Comments
9 pages