Enumeration schemes and, more importantly, their automatic generation
From MaRDI portal
Publication:1305201
DOI10.1007/BF01608488zbMATH Open0931.05006arXivmath/9805126MaRDI QIDQ1305201FDOQ1305201
Authors: Doron Zeilberger 
Publication date: 30 September 1999
Published in: Annals of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math/9805126
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
Cited In (20)
- Some enumerative results related to ascent sequences
- Enumeration schemes for vincular patterns
- Refining enumeration schemes to count according to permutation statistics
- Pattern avoidance in ordered set partitions
- Automatic discovery of structural rules of permutation classes
- Finite transition matrices for permutations avoiding pairs of length four patterns
- Automatic enumeration of generalized Ménage numbers
- Restricted \(k\)-ary words and functional equations
- Catalan numbers and pattern restricted set partitions
- Subregularity in infinitely labeled generating trees of restricted permutations
- An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
- WILF
- Counting subwords in flattened partitions of sets
- Finitely labeled generating trees and restricted permutations
- On the Stanley--Wilf limit of 4231-avoiding permutations and a conjecture of Arratia
- Enumeration Schemes for Restricted Permutations
- ASCA, SASCA and DPA with Enumeration: Which One Beats the Other and When?
- Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3
- Title not available (Why is that?)
- Automatic generation of theorems and proofs on enumerating consecutive-Wilf classes
Uses Software
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)
