Carleton Author

Egge, Eric S.

Department

Mathematics and Statistics

Journal Title

Discrete Mathematics

Publication Date

2006

First Page

552

Publisher

Elsevier

Last Page

563

File Name

021_Egge-Eric_RestrictedSignedPermutationsCountedByTheSchroderNumbers.pdf

Keywords

Restricted permutation, Pattern-avoiding permutation, Forbidden subsequence, Schröder number, Signed permutation, Generating tree

Abstract

Gire, West, and Kremer have found ten classes of restricted permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. In this paper we enumerate eleven classes of restricted signed permutations counted by the large Schröder numbers, no two of which are trivially Wilf-equivalent. We obtain five of these enumerations by elementary methods, five by displaying isomorphisms with the classical Schröder generating tree, and one by giving an isomorphism with a new Schröder generating tree. When combined with a result of Egge and a computer search, this completes the classification of restricted signed permutations counted by the large Schröder numbers in which the set of restrictions consists of two patterns of length 2 and two of length 3.

Rights Management

Carleton College does not own the copyright to this work and the work is available through the Carleton College Library following the original publisher's policies regarding self-archiving. For more information on the copyright status of this work, refer to the current copyright holder.

RoMEO Color

Green

Preprint Archiving

Yes (with link to journal home page)

Postprint Archiving

Yes

Publisher PDF Archiving

No

Contributing Organization

Carleton College

Type

Article

Format

application/pdf

Language

English

Included in

Mathematics Commons

Share

COinS