2000 character limit reached
Arrow type impossibility theorems over median algebras
Published 19 Aug 2015 in cs.DM | (1508.04741v1)
Abstract: We characterize trees as median algebras and semilattices by relaxing conservativeness. Moreover, we describe median homomorphisms between products of median algebras and show that Arrow type impossibility theorems for mappings from a product $\mathbf{A}_1\times \cdots \times \mathbf{A}_n$ of median algebras to a median algebra $\mathbf{B}$ are possible if and only if $\mathbf{B}$ is a tree, when thought of as an ordered structure.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.