A Coxeter type classification of Dynkin type \mathbb{A}_n non-negative posets

Abstract: 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} := f r a c 12 (C_{I} + C_{I}^{t r}) i n m a t h b b M_{m} (m a t h b b Q)

is positive semi-definite of rank

n g e q 0

, where

C_{I} i n m a t h b b M_{m} (m a t h b b Z)

is the incidence matrix of

I

encoding the relation

p r e c e q_{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 a t h b b A_{n}

. We show that such posets

I

, with

| I | > 1

, yield exactly

l f l o o r f r a c m 2 f l o o r

Coxeter types, one of which describes the positive (i.e., with

n = m

) 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

m a t h b b Z

-congruent if and only if

m a t h b f {s p e c c}_{I} = m a t h b f {s p e c c}_{J}

, and present deterministic algorithms that calculate a

m a t h b b Z

-invertible matrix defining such a

m a t h b b Z

-congruence in a polynomial time.

This page was built for publication: A Coxeter type classification of Dynkin type $\mathbb{A}_n$ non-negative posets