English

Antichain generating polynomials of posets

Combinatorics 2019-05-17 v1

Abstract

This paper gives a formula for the antichain generating polynomial N[k]×Q\mathcal{N}_{[k]\times Q} of the poset [k]×Q[k]\times Q, where [k][k] is an arbitrary chain and QQ is any finite graded poset. When QQ specializes to be a connected minuscule poet, which was classified by Proctor in 1984, we find that the polynomial N[k]×Q\mathcal{N}_{[k]\times Q} bears nice properties. For instance, we will recover the BnB_n-Narayana polynomial and the D2n+2D_{2n+2}-Narayana polynomial. We collect evidence for the conjecture that whenever N[k]×P(x)\mathcal{N}_{[k]\times P}(x) is palindromic, it must be γ\gamma-positive. Moreover, the family N[2]×[n]×[m]\mathcal{N}_{[2]\times [n]\times [m]} should be real-rooted and N[2]×[n]×[n+1]\mathcal{N}_{[2]\times [n]\times [n+1]} should be γ\gamma-positive. We also conjecture that NQ(x)\mathcal{N}_{Q}(x) is log-concave (thus unimodal) for any connected Peck poset QQ.

Cite

@article{arxiv.1905.06692,
  title  = {Antichain generating polynomials of posets},
  author = {Jian Ding and Chao-Ping Dong},
  journal= {arXiv preprint arXiv:1905.06692},
  year   = {2019}
}

Comments

This preprint describes several conjectures that could be interesting. We sincerely welcome comments, suggestions, and possible further joint work

R2 v1 2026-06-23T09:08:36.155Z