Stanley's conjecture on the Schur positivity of distributive lattices

In this paper we solve an open problem on distributive lattices, which was proposed by Stanley in 1998. This problem was motivated by a conjecture due to Griggs, which equivalently states that the incomparability graph of the boolean algebra \(B_n\) is nice. Stanley introduced the idea of studying t...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2024-08
Main Authors: Li, Grace M X, Qiu, Dun, Yang, Arthur L B, Zhong-Xue, Zhang
Format: Article
Language:English
Subjects:
Boolean algebra
Lattices (mathematics)
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we solve an open problem on distributive lattices, which was proposed by Stanley in 1998. This problem was motivated by a conjecture due to Griggs, which equivalently states that the incomparability graph of the boolean algebra \(B_n\) is nice. Stanley introduced the idea of studying the nice property of a graph by investigating the Schur positivity of its corresponding chromatic symmetric functions. Since the boolean algebras form a special class of distributive lattices, Stanley raised the question of whether the incomparability graph of any distributive lattice is Schur positive. Stanley further noted that this seems quite unlikely. In this paper, we construct a family of distributive lattices which are not nice and hence not Schur positive. We also provide a family of distributive lattices which are nice but not Schur positive.
ISSN:2331-8422