2013
DOI: 10.1155/2013/743734
|View full text |Cite
|
Sign up to set email alerts
|

A Framework for Coxeter Spectral Classification of Finite Posets and Their Mesh Geometries of Roots

Abstract: Following our paper [Linear Algebra Appl. 433(2010), 699–717], we present a framework and computational tools for the Coxeter spectral classification of finite posetsJ≡(J,⪯). One of the main motivations for the study is an application of matrix representations of posets in representation theory explained by Drozd [Funct. Anal. Appl. 8(1974), 219–225]. We are mainly interested in a Coxeter spectral classification of posetsJsuch that the symmetric Gram matrixGJ:=(1/2)[CJ+CJtr]∈𝕄J(ℚ)is positive semidefinite, whe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
18
0

Year Published

2013
2013
2015
2015

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 24 publications
(18 citation statements)
references
References 31 publications
(118 reference statements)
0
18
0
Order By: Relevance
“…Following [22, (2.3)], we identify J with the edge-bipartite (signed) graph Δ J (see [18]- [22]), without loops and solid edges, and with the dotted edges • i ---• j , for all i ≺ j.…”
Section: Notation and Terminologymentioning
confidence: 99%
See 4 more Smart Citations
“…Following [22, (2.3)], we identify J with the edge-bipartite (signed) graph Δ J (see [18]- [22]), without loops and solid edges, and with the dotted edges • i ---• j , for all i ≺ j.…”
Section: Notation and Terminologymentioning
confidence: 99%
“…Following [16] and [22], we define a poset J to be positive (resp. non-negative), if the symmetric Gram matrix…”
Section: Notation and Terminologymentioning
confidence: 99%
See 3 more Smart Citations