English

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

Combinatorics 2023-07-31 v4 Discrete Mathematics

Abstract

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

Keywords

Cite

@article{arxiv.2205.15032,
  title  = {Structure of non-negative posets of Dynkin type $\mathbb{A}_n$},
  author = {Marcin Gąsiorek},
  journal= {arXiv preprint arXiv:2205.15032},
  year   = {2023}
}

Comments

23 pages; major revision