Representing finite convex geometries by relatively convex sets
| dc.contributor.author | Adaricheva, Kira | |
| dc.date.accessioned | 2016-02-09T04:56:58Z | |
| dc.date.available | 2016-02-09T04:56:58Z | |
| dc.date.issued | 2011 | |
| dc.description.abstract | A closure system with the anti-exchange axiom is called a convex geometry. One geometry is called a sub-geometry of the other if its closed sets form a sublattice in the lattice of closed sets of the other. We prove that convex geometries of relatively convex sets in n-dimensional vector space and their nite sub-geometries satisfy the n-Carousel Rule, which is the strengthening of the n-Carath eodory property. We also nd another property, that is similar to the simplex partition property and does not follow from 2-Carusel Rule, which holds in sub-geometries of 2-dimensional geometries of relatively convex sets. | ru_RU |
| dc.identifier.citation | Adaricheva Kira; 2011; Representing finite convex geometries by relatively convex sets; arXiv.org | ru_RU |
| dc.identifier.uri | http://nur.nu.edu.kz/handle/123456789/1205 | |
| dc.language.iso | en | ru_RU |
| dc.rights | Attribution-NonCommercial-ShareAlike 3.0 United States | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/us/ | * |
| dc.subject | Research Subject Categories::MATHEMATICS | ru_RU |
| dc.subject | finite convex geometries | ru_RU |
| dc.title | Representing finite convex geometries by relatively convex sets | ru_RU |
| dc.type | Article | ru_RU |