Classification of integral trees (Q1089363)

If R is a homogeneous k-algebra and if Q is a finite poset, then R is an algebra with straightening laws (ASL) on Q over k if the chain monomials \(\alpha_ 1\alpha_ 2...\alpha_ p\) \((\alpha_ 1\leq \alpha_ 2...\leq \alpha_ p)\) form a basis of R, where if \(\alpha\) and \(\beta\) are incomparable elements then \(\alpha \beta =\sum r_ i\gamma_ i\delta_ i\), \(\gamma_ i\leq \delta_ i\), is given uniquely. In general, given a field k and an algebra associated via a poset P, it is a matter of interest to relate properties of the algebra to properties of the poset P. Incidence algebras and Stanley-Reisner algebras are among the types of algebras where this approach has been succussful. Graph algebras present another option. In this case the author provides a complete classification of those finite posets Q which are rank 1 (height 1) trees which have the additional property that over infinite fields some ASL associated with \(Q\cup \{T\}\) (T\(\not\in Q\) becomes a universal minimum) is also a domain (in the noncommutative sense).