A Coxeter type classification of Dynkin type $\mathbb{A}_n$ non-negative posets
Abstract
We continue the Coxeter spectral analysis of finite connected posets that are non-negative in the sense that their symmetric Gram matrix is positive semi-definite of rank , where is the incidence matrix of encoding the relation . We extend the results of [Fundam. Inform., 139.4(2015), 347--367] and give a complete Coxeter spectral classification of finite connected posets of Dynkin type . We show that such posets , with , yield exactly Coxeter types, one of which describes the positive (i.e., with ) ones. We give an exact description and calculate the number of posets of every type. Moreover, we prove that, given a pair of such posets and , the incidence matrices and are -congruent if and only if , and present deterministic algorithms that calculate a -invertible matrix defining such a -congruence in a polynomial time.
Cite
@article{arxiv.2205.15813,
title = {A Coxeter type classification of Dynkin type $\mathbb{A}_n$ non-negative posets},
author = {M. Gąsiorek},
journal= {arXiv preprint arXiv:2205.15813},
year = {2023}
}