A new proof of Monjardet's median theorem

Simple item page
dc.creatorLoeb, Daniel E.
dc.date1995-02-09
dc.date.accessioned2026-07-07T09:15:16Z
dc.date.available2026-07-07T09:15:16Z
dc.descriptionNew proofs are given for Monjardet's theorem that all strong simple games (i.e., ipsodual elements of the free distributive lattice) can be generated by the median operation. Tighter limits are placed on the number of iterations necessary. Comparison is drawn with the $χ$ function which also generates all strong simple games.
dc.identifierhttps://arxiv.org/abs/math/9502223
dc.identifierhttp://arxiv.org/abs/math/9502223
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/152963
dc.subjectCombinatorics
dc.subject05Dxx 06A12
dc.titleA new proof of Monjardet's median theorem
dc.typetext

Files

Collections

arXiv