Enumeration schemes and, more importantly, their automatic generation

DOI10.1007/BF01608488MaRDI QIDQ1305201zbMATH OpenFDO

Authors Doron Zeilberger

Publication date 30 September 1999

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9805126

zbMATH Keywords

enumerationWilf classes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

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.

Recommendations

• Automatic generation of theorems and proofs on enumerating consecutive-Wilf classes
• Enumeration Schemes for Restricted Permutations
• Enumeration schemes for words avoiding permutations
• Using Noonan-Zeilberger functional equations to enumerate (in polynomial time!) generalized Wilf classes
• scientific article; zbMATH DE number 5274220

Cites work

• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Generating trees and the Catalan and Schröder numbers
• What is an Answer?

Cited in

(20)

• On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
• scientific article; zbMATH DE number 5274220 (Why is no real title available?)
• Pattern avoidance in ordered set partitions
• Some enumerative results related to ascent sequences
• Automatic enumeration of generalized Ménage numbers
• Enumeration Schemes for Restricted Permutations
• Restricted \(k\)-ary words and functional equations
• ASCA, SASCA and DPA with Enumeration: Which One Beats the Other and When?
• Enumeration schemes for vincular patterns
• Refining enumeration schemes to count according to permutation statistics
• Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3
• Subregularity in infinitely labeled generating trees of restricted permutations
• WILF
• Automatic discovery of structural rules of permutation classes
• Automatic generation of theorems and proofs on enumerating consecutive-Wilf classes
• Finitely labeled generating trees and restricted permutations
• An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
• Counting subwords in flattened partitions of sets
• Catalan numbers and pattern restricted set partitions
• Finite transition matrices for permutations avoiding pairs of length four patterns

Describes a project that uses

Uses Software

• HERB

This page was built for publication: Enumeration schemes and, more importantly, their automatic generation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1305201)