Papers
Topics
Authors
Recent
Search
2000 character limit reached

Antichain generating polynomials of posets

Published 16 May 2019 in math.CO | (1905.06692v1)

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

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.