Enumeration Schemes And (More Importantly) Their Automatic Generation

Simple item page
dc.creatorZeilberger, Doron
dc.date1998-05-27
dc.date.accessioned2026-07-07T05:24:52Z
dc.date.available2026-07-07T05:24:52Z
dc.descriptionIt 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.
dc.description11 pages, to appear in Annals of Combinatorics
dc.identifierhttps://arxiv.org/abs/math/9805126
dc.identifierhttp://arxiv.org/abs/math/9805126
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/76972
dc.subjectCombinatorics
dc.titleEnumeration Schemes And (More Importantly) Their Automatic Generation
dc.typetext

Files

Collections

arXiv