Mathematics of Plott choice functions
| dc.creator | Danilov, V. I. | |
| dc.creator | Koshevoy, G. A. | |
| dc.date | 2003-04-14 | |
| dc.date.accessioned | 2026-07-07T04:56:50Z | |
| dc.date.available | 2026-07-07T04:56:50Z | |
| dc.description | This paper is devoted to a study of mathematical structures arising from choice functions satisfying the path independence property (Plott functions). We broaden the notion of a choice function by allowing of empty choice. This enables us to define a lattice structure on the set of Plott functions. Moreover, this lattice is functorially dependent on its base. We introduce a natural convex structure on the set of linear orders (or words) and show that Plott functions are in one-to-one correspondence with convex subsets in this set of linear orders. That correspondence is compatible with both lattice structures. Keywords: Convex geometries, shuffle, linear orders, lattices, direct image, path independence, convex structure | |
| dc.description | 25 pages, 6 figures | |
| dc.identifier | https://arxiv.org/abs/math/0304171 | |
| dc.identifier | http://arxiv.org/abs/math/0304171 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/67066 | |
| dc.subject | Combinatorics | |
| dc.title | Mathematics of Plott choice functions | |
| dc.type | text |