A Coxeter type classification of Dynkin type 𝔸_n non-negative posets

05/31/2022
βˆ™
by   M. GΔ…siorek, et al.
βˆ™
0
βˆ™

We continue the Coxeter spectral analysis of finite connected posets I that are non-negative in the sense that their symmetric Gram matrix G_I:=1/2(C_I + C_I^tr)βˆˆπ•„_n(β„š) is positive semi-definite of rank n-𝐜𝐫𝐀_Iβ‰₯ 0, where C_Iβˆˆπ•„_n(β„€) is the incidence matrix of I encoding the relation β‰Ό_I. We extend the results of Fundam. Inform., 139.4(2015), 347–367] and give a complete Coxeter spectral classification of finite connected posets I of Dynkin type 𝔸_m. We show that such posets I, with |I|>1, yield exactly ⌊n/2βŒ‹ Coxeter types, one of which describes the positive (i.e., 𝐜𝐫𝐀_I=0) 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 I and J, the incidence matrices C_I and C_J are β„€-congruent if and only if 𝐬𝐩𝐞𝐜𝐜_I = 𝐬𝐩𝐞𝐜𝐜_J, and present deterministic algorithms that calculate a β„€-invertible matrix defining such a β„€-congruence in a polynomial time.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro