Total orderization invariant maps on distributive lattices
Abstract
Given any finite subset of order of a distributive lattice and , there is a natural extension of the median operation to variables which generalizes the notion of the th smallest element of . By applying each of these operations to , a totally ordered set is obtained. We refer to as the total orderization of . After developing a brief theory of total orderization invariant maps on distributive lattices, it is shown in this paper how these functions generalize and provide new characterizations for symmetric continuous positively homogeneous functions, bounded orthosymmetric multilinear maps, and certain power sum polynomials on vector lattices. These theorems generalize several results by Bernau, Huijsmans, Kusraev, Azouzi, Boulabiar, Buskes, Boyd, Ryan, and Snigireva and in turn reveal novel properties of the various maps studied in this paper.
Cite
@article{arxiv.2206.14470,
title = {Total orderization invariant maps on distributive lattices},
author = {Christopher Michael Schwanke},
journal= {arXiv preprint arXiv:2206.14470},
year = {2022}
}