Simple permutations and algebraic generating functions

Authors:
Robert Brignall;Sophie Huczynska;Vincent Vatter
Affiliations:
University of St Andrews, School of Mathematics and Statistics, St Andrews, Fife, KY16 9SS, UK;University of St Andrews, School of Mathematics and Statistics, St Andrews, Fife, KY16 9SS, UK;University of St Andrews, School of Mathematics and Statistics, St Andrews, Fife, KY16 9SS, UK
Venue:
Journal of Combinatorial Theory Series A
Year:
2008

Citing 13
Cited 3

Enumerative combinatorics

Enumerative combinatorics
Bootstrap percolation, the Schro¨der numbers, and the N-kings problem

SIAM Journal on Discrete Mathematics
Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures

Discrete Mathematics
Sorting twice through a stack

Selected papers of the conference on Formal power series and algebraic combinatorics
A k-structure generalization of the theory of 2-structures

Theoretical Computer Science
On the closure of graphs under substitution

Discrete Mathematics
Exact enumeration of 1342-avoiding permutations: a close link with labeled trees and planar maps

Journal of Combinatorial Theory Series A
Restricted permutations

Discrete Mathematics
Enumeration of vexillary involutions which are equal to their mirror/complement

Discrete Mathematics
Regular Article: Restricted 132-Avoiding Permutations

Advances in Applied Mathematics
132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers

Discrete Applied Mathematics
Decreasing Subsequences in Permutations and Wilf Equivalence for Involutions

Journal of Algebraic Combinatorics: An International Journal
Simple permutations: Decidability and unavoidable substructures

Theoretical Computer Science

Simple permutations: Decidability and unavoidable substructures

Theoretical Computer Science
Small configurations in simple permutations

European Journal of Combinatorics
Substitution-closed pattern classes

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

A simple permutation is one that never maps a nontrivial contiguous set of indices contiguously. Given a set of permutations that is closed under taking subpermutations and contains only finitely many simple permutations, we provide a framework for enumerating subsets that are restricted by properties belonging to a finite ''query-complete set.'' Such properties include being even, being an alternating permutation, and avoiding a given generalised (blocked or barred) pattern. We show that the generating functions for these subsets are always algebraic, thereby generalising recent results of Albert and Atkinson. We also apply these techniques to the enumeration of involutions and cyclic closures.