Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #32 Aug 21 2023 12:44:28
%S 1,1,2,6,34,672,199572,12884849614
%N Number of different nonisomorphic antimatroids on n labeled items.
%C See link for software to generate the sequence. The next item (for n=8) should be roughly 2^63 and seems hopeless without more mathematics.
%C Antimatroids are a subset of greedoids, usually defined either in terms of set systems, as David Eppstein does in his tree searches, or in terms of formal languages. The two are equivalent, as discussed in Kempner and Levit.
%H Kira Adaricheva and Arav Agarwal, <a href="https://arxiv.org/abs/2308.07384">Representation of convex geometries of convex dimension 3 by spheres</a>, arXiv:2308.07384 [math.CO], 2023.
%H Domenico Cantone, Jean-Paul Doignon, Alfio Giarlotta, and Stephen Watson, <a href="https://arxiv.org/abs/2103.01581">Resolutions of Convex Geometries</a>, arXiv:2103.01581 [math.CO], 2021.
%H D. Eppstein, <a href="https://11011110.github.io/blog/2006/06/18/reverse-search-for.html">Reverse search for antimatroids</a>.
%H Yulia Kempner, Vadim E. Levit, <a href="http://arXiv.org/abs/math/0307013">Correspondence between two antimatroid algorithmic characterizations</a>, arXiv:math/0307013 [math.CO], 2003.
%H P. Uznanski <a href="http://paracombinatorics.wordpress.com/2013/04/19/enumeration-of-antimatroids-part-iv/">Enumeration of antimatroids</a>
%e The three antimatroids on the two items 0 and 1 are (a) {},{0},{0,1}, (b) {},{1},{0,1} and (c) {},{0},{1},{0,1}, out of which (a) and (b) are isomorphic, leaving (a)/(b) and (c) as two nonisomorphic antimatroids.
%Y Cf. A119770 (counts antimatroids, not taking symmetries into account).
%K nonn,hard,more
%O 0,3
%A _Przemyslaw Uznanski_, Apr 19 2013