In this paper we provide an efficient algorithm for computing the graph representing a d-dimensional poset which is given by means of the d linear extensions realizing it. @ 1997 Elsevier Science B.V.
Realizable posets
β Scribed by R. S. Pierce; C. Vinsonhaler
- Publisher
- Springer Netherlands
- Year
- 1990
- Tongue
- English
- Weight
- 494 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0167-8094
No coin nor oath required. For personal study only.
β¦ Synopsis
Certain p-local orders in n-dimensional division algebras over the rational numbers occur as endomorphism rings of torsion-free abelian groups of rank n if and only if an associated finite poset P has a strict faithful representation of dimension less than [Pi over the field with p elements.
In this note we obtain a simple characterization of those finite posets which do not admit such a representation.
π SIMILAR VOLUMES
We consider a notion of sequential functional of ΓΏnite type, more generous than the familiar notion embodied in Plotkin's language PCF. We study both the "full" and "e ective" partial type structures arising from this notion of sequentiality. The full type structure coincides with that given by the