2000 character limit reached
Structure of non-negative posets of Dynkin type
Published 30 May 2022 in math.CO and cs.DM | (2205.15032v4)
Abstract: A poset is called non-negative if the symmetric Gram matrix is positive semi-definite, where is the -matrix encoding the relation . Every such a connected poset , up to the -congruence of the matrix, is determined by a unique simply-laced Dynkin diagram . We show that implies that the matrix is of rank or . Moreover, we depict explicit shapes of Hasse digraphs of all such posets~ and devise formulae for their number.
Paper Prompts
Sign up for free to create and run prompts on this paper.