Algorithms for permutation statistics

@inproceedings{Zeilberger2011AlgorithmsFP,
  title={Algorithms for permutation statistics},
  author={Doron Zeilberger and Andrew M. Baxter},
  year={2011}
}
Two sequences u; v of n positive integers are order isomorphic if their terms are in the same relative order. A permutation p said to contain permutation q as a pattern if there is some subsequence of p which is order isomorphic to q. This subsequence is called a copy of q. This notion of pattern containment is generalized to include adjacency restrictions as per dashed patterns. The primary permutation statistics studied in this work are written in terms of the number of copies of a given… 

Refining Enumeration Schemes to Count According to Permutation Statistics

TLDR
It is proved that when a finite enumeration scheme exists to compute the number of permutations avoiding a given set of vincular patterns, the scheme can also compute the distribution of certain permutation statistics with very little extra computation.

Subregularity in infinitely labeled generating trees of restricted permutations

Some Wilf-equivalences for vincular patterns

We prove several Wilf-equivalences for vincular patterns of length 4, some of which generalize to infinite families of vincular patterns. We also present functional equations for the generating

Noncommutative Bell polynomials and the dual immaculate basis

We define a new family of noncommutative Bell polynomials in the algebra of free quasi-symmetric functions and relate it to the dual immaculate basis of quasi-symmetric functions. We obtain

Shape-Wilf-equivalences for vincular patterns

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

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

References

SHOWING 1-10 OF 101 REFERENCES

Decreasing Subsequences in Permutations and Wilf Equivalence for Involutions

In a recent paper, Backelin, West and Xin describe a map φ* that recursively replaces all occurrences of the pattern k... 21 in a permutation σ by occurrences of the pattern (k−1)... 21 k. The

Permutation tableaux and permutation patterns

The Möbius function of the permutation pattern Poset

TLDR
A large class of pairs of permutations whose intervals in P have Mobius function 0 and a graded poset P is given, which gives a solution to the problem when \sigma occurs precisely once in \tau, and\sigma and\tau satisfy certain further conditions, in which case theMobius function is shown to be either -1, 0 or 1.

Generalized permutation patterns and a classification of the Mahonian statistics

We introduce generalized permutation patterns, where we allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We show that essentially all Mahonian

Generalized permutation patterns - a short survey

An occurrence of a classical pattern p in a permutation π is a subsequence of π whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some

Partially ordered generalized patterns

  • S. Kitaev
  • Mathematics, Computer Science
    Discret. Math.
  • 2005

A Spectral Approach to Consecutive Pattern-Avoiding Permutations

We consider the problem of enumerating permutations in the symmetric group on $n$ elements which avoid a given set of consecutive pattern $S$, and in particular computing asymptotics as $n$ tends to

Generalized Pattern Avoidance

TLDR
A complete solution is given for the number of permutations avoiding any single pattern of length three with exactly one adjacent pair of letters, and a new class of set partitions is defined, called monotone partitions, and these partitions are in one-to-one correspondence with non-overlapping partitions.

Subsequence Containment by Involutions

TLDR
An exact count of the involutions in S_n which contain a given permutation \tau in S-k as a subsequence is given; this number depends on the patterns of the first j values of \tAU for 1<=j<=k.

On Growth Rates of Closed Permutation Classes

A class of permutations is called closed if 2 implies 2 , where the relation is the natural containment of permutations. Let n be the set of all permutations of 1, 2 ,...,n belonging to . We
...