Structure of non-negative posets of Dynkin type ๐”ธ_n

05/30/2022
โˆ™
by   Marcin Gฤ…siorek, et al.
โˆ™
0
โˆ™

We study, in terms of directed graphs, partially ordered sets (posets) I=({1,โ€ฆ, n}, โ‰ผ_I) that are non-negative in the sense that their symmetric Gram matrix G_I:=1/2(C_I + C_I^tr)โˆˆ๐•„_|I|(โ„š) is positive semi-definite, where C_Iโˆˆ๐•„_n(โ„ค) is the incidence matrix of I encoding the relation โ‰ผ_I. We give a complete, up to isomorphism, structural description of connected posets I of Dynkin type Dyn_I=๐”ธ_n in terms of their Hasse digraphs โ„‹(I) that uniquely determine I. One of the main results of the paper is the proof that the matrix G_I is of rank n or n-1, i.e., every non-negative poset I with Dyn_I=๐”ธ_n is either positive or principal. Moreover, we depict explicit shapes of Hasse digraphs โ„‹(I) of all non-negative posets I with Dyn_I=๐”ธ_n. We show that โ„‹(I) is isomorphic to an oriented path or cycle with at least two sinks. By giving explicit formulae for the number of all possible orientations of the path and cycle graphs, up to the isomorphism of unlabeled digraphs, we devise formulae for the number of non-negative posets of Dynkin type ๐”ธ_n.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset