Publication:
Uniform Antimatroid Closure Spaces

dc.contributor.authorJohn, L
dc.contributor.authorJohn, E
dc.date.accessioned2026-01-22T21:51:45Z
dc.date.issued1998-01-01
dc.descriptionOriginal submission date: 2012-10-29T21:15:55Z
dc.description.abstractOften the structure of discrete sets can be described in terms of a closure operator. When each closed set has a unique minimal generating set (as in convex geometries in which the extreme points of a convex set generate the closed set), we have an antimatroid closure space. In this paper, we show there exist antimatroid closure spaces of any size, of which convex geometries are only a sub-family, all of whose closed sets are generated by precisely the same number of points. We call them uniform closure spaces.
dc.identifiertd96k2496
dc.identifier.citationJohn, L, and E John. "Uniform Antimatroid Closure Spaces." University of Virginia Dept. of Computer Science Tech Report (1998).
dc.identifier.doi10.18130/V31N39
dc.identifier.urihttps://doi.org/10.18130/V31N39
dc.identifier.urihttps://libraopen.library.virginia.edu/handle/item/9246
dc.languageEnglish
dc.language.isoen
dc.publisherUniversity of Virginia, Department of Computer Science
dc.rightsAll rights reserved (no additional license for public reuse)
dc.titleUniform Antimatroid Closure Spaces
dc.typeTechnical Report
dspace.entity.typePublication
relation.isAuthorOfPublication7e4ea7d9-42fc-4372-ad8d-381b82d4424e
relation.isAuthorOfPublication3bb105a4-02a9-461c-900d-121f97c5c12c
relation.isAuthorOfPublication.latestForDiscovery7e4ea7d9-42fc-4372-ad8d-381b82d4424e

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
CS-98-17.pdf
Size:
240.24 KB
Format:
Adobe Portable Document Format

Collections