Enumeration schemes for restricted permutations

Vincent Vatter

doi:10.1017/S0963548307008516

Enumeration schemes for restricted permutations

Vincent Vatter

Pure Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more permutation classes and describe the Maple package WILFPLUS, which implements this process. We also compare enumeration schemes to three other systematic enumeration techniques: generating trees, substitution decompositions, and the insertion encoding.

Original language	English
Pages (from-to)	137-159
Number of pages	23
Journal	Combinatorics, Probability and Computing
Volume	17
Issue number	1
DOIs	https://doi.org/10.1017/S0963548307008516
Publication status	Published - Jan 2008

Access to Document

10.1017/S0963548307008516

EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications
Linton, S. A. (PI), Gent, I. P. (CoI), Leonhardt, U. (CoI), Mackenzie, A. (CoI), Miguel, I. J. (CoI), Quick, M. (CoI) & Ruskuc, N. (CoI)
EPSRC
1/09/05 → 31/08/10
Project: Standard

Cite this

@article{51e3c9f091a94513a014bc5f818426d6,

title = "Enumeration schemes for restricted permutations",

abstract = "Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more permutation classes and describe the Maple package WILFPLUS, which implements this process. We also compare enumeration schemes to three other systematic enumeration techniques: generating trees, substitution decompositions, and the insertion encoding.",

author = "Vincent Vatter",

year = "2008",

month = jan,

doi = "10.1017/S0963548307008516",

language = "English",

volume = "17",

pages = "137--159",

journal = "Combinatorics, Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

number = "1",

}

TY - JOUR

T1 - Enumeration schemes for restricted permutations

AU - Vatter, Vincent

PY - 2008/1

Y1 - 2008/1

N2 - Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more permutation classes and describe the Maple package WILFPLUS, which implements this process. We also compare enumeration schemes to three other systematic enumeration techniques: generating trees, substitution decompositions, and the insertion encoding.

AB - Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply to many more permutation classes and describe the Maple package WILFPLUS, which implements this process. We also compare enumeration schemes to three other systematic enumeration techniques: generating trees, substitution decompositions, and the insertion encoding.

U2 - 10.1017/S0963548307008516

DO - 10.1017/S0963548307008516

M3 - Article

SN - 0963-5483

VL - 17

SP - 137

EP - 159

JO - Combinatorics, Probability and Computing

JF - Combinatorics, Probability and Computing

IS - 1

ER -

Enumeration schemes for restricted permutations

Abstract

Access to Document

Fingerprint

Projects

EP/C523229/1: Multidisciplinary Critical Mass in Computational Algebra and Applications

Cite this