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

arXiv2205.15032MaRDI QIDQ6400538FDOQ6400538

Publication date: 30 May 2022

Abstract: We study, in terms of directed graphs, partially ordered sets (posets)

I = (1, l d o t s, n, p r e c e q_{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_{| I |} (m a t h b b Q)

is positive semi-definite, where

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

is the incidence matrix of

I

encoding the relation

p r e c e q_{I}

. We give a complete, up to isomorphism, structural description of connected posets

I

of Dynkin type

m a t h r m {D y n}_{I} = m a t h b b A_{n}

in terms of their Hasse digraphs

m a t h c a l H (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

m a t h r m {D y n}_{I} = m a t h b b A_{n}

is either positive or principal. Moreover, we depict explicit shapes of Hasse digraphs

m a t h c a l H (I)

of all non-negative posets

I

with

m a t h r m {D y n}_{I} = m a t h b b A_{n}

. We show that

m a t h c a l H (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

m a t h b b A_{n}

.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Enumeration in graph theory (05C30) Combinatorics of partially ordered sets (06A07) Quadratic and bilinear forms, inner products (15A63) Algebraic aspects of posets (06A11)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6400538)