Automatic Generation of Theorems and Proofs on Enumerating Consecutive-Wilf Classes

Andrew Baxter (), Brian Nakamura () and Doron Zeilberger ()
Additional contact information
Andrew Baxter: Rutgers University (New Brunswick), Department of Mathematics
Brian Nakamura: Rutgers University (New Brunswick), Department of Mathematics
Doron Zeilberger: Rutgers University (New Brunswick), Department of Mathematics

A chapter in Advances in Combinatorics, 2013, pp 121-138 from Springer

Abstract: Abstract This article, describes two complementary approaches to enumeration, the positive and the negative, each with its advantages and disadvantages. Both approaches are amenable to automation, and we apply it to the currently active subarea, initiated in 2003 by Sergi Elizalde and Marc Noy, of enumerating consecutive-Wilf classes (i.e. consecutive pattern-avoidance) in permutations.

Keywords: Automated enumeration; Consecutive pattern-avoidance (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-30979-3_6

Ordering information: This item can be ordered from
http://www.springer.com/9783642309793

DOI: 10.1007/978-3-642-30979-3_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().