Pruning Processes and a New Characterization of Convex Geometries

Simple item page
dc.creatorArdila, Federico
dc.creatorManeva, Elitza
dc.date2007-06-26
dc.date2008-08-31
dc.date.accessioned2026-07-07T09:59:15Z
dc.date.available2026-07-07T09:59:15Z
dc.descriptionWe provide a new characterization of convex geometries via a multivariate version of an identity that was originally proved by Maneva, Mossel and Wainwright for certain combinatorial objects arising in the context of the k-SAT problem. We thus highlight the connection between various characterizations of convex geometries and a family of removal processes studied in the literature on random structures.
dc.description14 pages, 3 figures; the exposition has changed significantly from previous version
dc.identifierhttps://arxiv.org/abs/0706.3750
dc.identifierhttp://arxiv.org/abs/0706.3750
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/167954
dc.subjectCombinatorics
dc.subjectDiscrete Mathematics
dc.subjectProbability
dc.subject06A07; 52B40; 60C05; 68R05; 68W40
dc.titlePruning Processes and a New Characterization of Convex Geometries
dc.typetext

Files

Collections

arXiv