In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which...

an antimatroid is (i) a greedoid with a unique basis; or (ii) an accessible set system closed under union. It is easy to see that an antimatroid is also...

convex hull operator is an example of a closure operator, and every antimatroid can be represented by applying this closure operator to finite sets of...

can be modeled as the basic words of an antimatroid; Chandran et al. (2003) use this connection to antimatroids as part of an algorithm for efficiently...

of feasible competencies forms the mathematical structure known as an antimatroid. Researchers and educators usually explore the structure of a discipline's...

The "convex dimension" of an antimatroid is defined as the minimum number of chains needed to define the antimatroid, and Dilworth's theorem can be...

the particular class of partial orders known as the interval orders. Antimatroid, a formalization of orderings on a set that allows more general families...

said to belong to the same grammar. A grammar in OT is equivalent to an antimatroid. If rankings with ties are allowed, then the number of possibilities...

Robertson–Seymour Graph Minors Project (see Robertson–Seymour theorem). Antimatroid – Mathematical system of orderings or sets Coxeter matroid – Group-theoretic...

Other examples of set families are independence systems, greedoids, antimatroids, and bornological spaces. Algebra of sets – Identities and relationships...