Lexicographic cones and the ordered projective tensor product

We are excited to announce that the repository will soon undergo an upgrade, featuring a new look and feel along with several enhanced features to improve your experience. Please be on the lookout for further updates and announcements regarding the launch date. We appreciate your support and look forward to unveiling the improved platform soon.

Show simple item record

dc.contributor.author Wortel, Marten
dc.date.accessioned 2020-02-26T05:10:51Z
dc.date.issued 2019-08
dc.description.abstract We introduce lexicographic cones, a method of assigning an ordered vector space Lex(S) to a poset S, generalising the standard lexicographic cone. These lexicographic cones are then used to prove that the projective tensor cone of two arbitrary cones is a cone, and to find a new characterisation of finite-dimensional vector lattices. en_ZA
dc.description.department Mathematics and Applied Mathematics en_ZA
dc.description.embargo 2020-08-10
dc.description.librarian hj2020 en_ZA
dc.description.uri https://www.springer.com/series/4961 en_ZA
dc.identifier.citation Wortel M. (2019) Lexicographic Cones and the Ordered Projective Tensor Product. In: Buskes G. et al. (eds) Positivity and Noncommutative Analysis. Trends in Mathematics. Birkhäuser, Cham. en_ZA
dc.identifier.issn 2297-0215
dc.identifier.other 10.1007/978-3-030-10850-2_30
dc.identifier.uri http://hdl.handle.net/2263/73550
dc.language.iso en en_ZA
dc.publisher Springer en_ZA
dc.rights © Springer Nature Switzerland AG 2019. The original publication is available at : https://www.springer.com/series/4961. en_ZA
dc.subject Lexicographic cone en_ZA
dc.subject Finite-dimensional vector lattices en_ZA
dc.subject Ordered projective tensor product en_ZA
dc.title Lexicographic cones and the ordered projective tensor product en_ZA
dc.type Postprint Article en_ZA


Files in this item

This item appears in the following Collection(s)

Show simple item record