IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-30979-3_6.html
   My bibliography  Save this book chapter

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

In: Advances in Combinatorics

Author

Listed:
  • 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)

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.

Suggested Citation

  • Andrew Baxter & Brian Nakamura & Doron Zeilberger, 2013. "Automatic Generation of Theorems and Proofs on Enumerating Consecutive-Wilf Classes," Springer Books, in: Ilias S. Kotsireas & Eugene V. Zima (ed.), Advances in Combinatorics, edition 127, pages 121-138, Springer.
  • Handle: RePEc:spr:sprchp:978-3-642-30979-3_6
    DOI: 10.1007/978-3-642-30979-3_6
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-30979-3_6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.