|
Search: id:A119770
|
|
|
| A119770 |
|
Number of different antimatroids on n labeled items. |
|
+0
1
|
| |
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
See link for software to generate the sequence. The next item (for n=6) should be roughly 2^32 and within computational reach. n=7 seems hopeless without more mathematics.
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 - Jonathan Vos Post (jvospost3(AT)gmail.com), Jun 20 2006
|
|
LINKS
|
D. Eppstein, Reverse search for antimatroids.
Yulia Kempner, Vadim E. Levit, Correspondence Between Two Antimatroid Algorithmic Characterizations
|
|
EXAMPLE
|
E.g. 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}.
|
|
CROSSREFS
|
Sequence in context: A002485 A099750 A156512 this_sequence A153230 A132558 A072113
Adjacent sequences: A119767 A119768 A119769 this_sequence A119771 A119772 A119773
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
David Eppstein (eppstein(AT)ics.uci.edu), Jun 19 2006
|
|
|
Search completed in 0.002 seconds
|
