Structure of non-negative posets of Dynkin type $\mathbb{A}_n$

TL;DR

This paper characterizes non-negative posets of Dynkin type A, showing their Gram matrices have rank n or n-1, and provides explicit descriptions and enumeration formulas for their Hasse diagrams.

Contribution

It classifies non-negative posets of Dynkin type A, describes their Gram matrices, and explicitly characterizes their Hasse digraphs and counts.

Findings

Gram matrices have rank n or n-1 for type A posets.

Explicit shapes of Hasse digraphs are provided.

Formulas for counting these posets are devised.

Abstract

A poset $I=(\{1,\ldots, n\}, \leq_I)$ is called non-negative if the symmetric Gram matrix $G_I:=\frac{1}{2}(C_I + C_I^{tr})\in\mathbb{M}_n(\mathbb{R})$ is positive semi-definite, where $C_I\in\mathbb{M}_n(\mathbb{Z})$ is the $(0,1)$-matrix encoding the relation $\leq_I$. Every such a connected poset $I$, up to the $\mathbb{Z}$-congruence of the $G_I$ matrix, is determined by a unique simply-laced Dynkin diagram $\mathrm{Dyn}_I\in\{\mathbb{A}_m, \mathbb{D}_m,\mathbb{E}_6,\mathbb{E}_7,\mathbb{E}_8\}$. We show that $\mathrm{Dyn}_I=\mathbb{A}_n$ implies that the matrix $G_I$ is of rank $n$ or $n-1$. Moreover, we depict explicit shapes of Hasse digraphs $\mathcal{H}(I)$ of all such posets~$I$ and devise formulae for their number.