Enumeration Schemes And (More Importantly) Their Automatic Generation
Combinatorics
2007-05-23 v1
Abstract
It is way too soon to teach our computers how to become full-fledged humans. It is even premature to teach them how to become mathematicians, it is even unwise, at present, to teach them how to become combinatorialists. But the time is ripe to teach them how to become experts in a suitably defined and narrowly focused subarea of combinatorics. In this article, I will describe my efforts to teach my beloved computer, Shalosh B. Ekhad, how to be an enumerator of Wilf classes.
Cite
@article{arxiv.math/9805126,
title = {Enumeration Schemes And (More Importantly) Their Automatic Generation},
author = {Doron Zeilberger},
journal= {arXiv preprint arXiv:math/9805126},
year = {2007}
}
Comments
11 pages, to appear in Annals of Combinatorics