English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We continue the Coxeter spectral analysis of finite connected posets $I$ thatare non-negative in the sense that their symmetric Gram matrix$G_I:=\frac{1}{2}(C_I + C_I^{tr})\in\mathbb{M}_{m}(\mathbb{Q})$ is positivesemi-definite of rank $n\geq 0$, where $C_I\in\mathbb{M}_m(\mathbb{Z})$ is theincidence matrix of $I$ encoding the relation $\preceq_I$. We extend theresults of [Fundam. Inform., 139.4(2015), 347--367] and give a complete Coxeterspectral classification of finite connected posets $I$ of Dynkin type$\mathbb{A}_n$. We show that such posets $I$, with $|I|>1$, yield exactly$\lfloor\frac{m}{2}\rfloor$ Coxeter types, one of which describes the positive(i.e., with $n=m$) ones. We give an exact description and calculate the numberof 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 $\mathbb{Z}$-congruentif and only if $\mathbf{specc}_I = \mathbf{specc}_J$, and present deterministicalgorithms that calculate a $\mathbb{Z}$-invertible matrix defining such a$\mathbb{Z}$-congruence in a polynomial time.

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