• Corpus ID: 85518077

Distributions of Statistics over Pattern-Avoiding Permutations

@article{Bukata2018DistributionsOS,
  title={Distributions of Statistics over Pattern-Avoiding Permutations},
  author={Michael Bukata and Ryan Kulwicki and Nicholas Lewandowski and Lara K. Pudwell and Jacob Roth and Teresa Wheeland},
  journal={J. Integer Seq.},
  year={2018},
  volume={22},
  pages={19.2.6}
}
We consider the distribution of ascents, descents, peaks, valleys, double ascents, and double descents over permutations avoiding a set of patterns. Many of these statistics have already been studied over sets of permutations avoiding a single pattern of length 3. However, the distribution of peaks over 321-avoiding permutations is new and we relate it statistics on Dyck paths. We also obtain new interpretations of a number of well-known combinatorial sequences by studying these statistics over… 

Figures and Tables from this paper

Crossings over permutations avoiding some pairs of three length-patterns

In this paper, we compute the distributions of the statistic number of crossings over permutations avoiding one of the pairs {321,231}, {123,132} and {123,213}. The obtained results are new

Crossings over permutations avoiding some pairs of patterns of length three

In this paper, we compute the distributions of the statistic number of crossings over permutations avoiding one of the pairs $\{321,231\}$, $\{123,132\}$ and $\{123,213\}$. The obtained results are

k-Arrangements, Statistics, and Patterns

As one application of the so-called Decrease Value Theorem, the generating function for a symmetric pair of Eulerian statistics over permutations arising in this study is calculated.

COMBINATOIRE DES PERMUTATIONS RESTREINTES SELON LE NOMBRE DE CROISEMENTS

In this thesis, we introduced and carried out a combinatorial study of permutations that avoid one or two patterns of length 3 according to the statistic number of crossings. For this purpose, we

Statistics on Almost-Fibonacci Pattern-Avoiding Permutations

. Let F n be the n -th Fibonacci number, using the convention F 0 = F 1 = 1, and define Av n ( S ) to be the set of all permutations of length n that avoid all of the patterns in the set S . We prove

Counting Consecutive Pattern Matches in $\mathcal{S}_n(132)$ and $\mathcal{S}_n(123)$

In this paper, we study the distribution of consecutive patterns in the set of 123-avoiding permutations and the set of 132-avoiding permutations, that is, in $\mathcal{S}_n(123)$ and

On q-poly-Bernoulli numbers arising from combinatorial interpretations

In this paper we present several natural q-analogues of the poly-Bernoulli numbers arising in combinatorial contexts. We also recall some related analytical results and ask for combinatorial

On q-poly-Bernoulli numbers arising from combinatorial interpretations

In this paper we present several natural q -analogues of the poly-Bernoulli numbers arising in combinatorial contexts. We also recall some related analytical results and ask for combinatorial

References

SHOWING 1-10 OF 12 REFERENCES

Statistics on pattern-avoiding permutations

This thesis concerns the enumeration of pattern-avoiding permutations with respect to certain statistics. Our first result is that the joint distribution of the pair of statistics ‘number of fixed

THE DESCENT STATISTIC ON 123-AVOIDING PERMUTATIONS

We exploit Krattenthaler's bijection between 123-avoi- ding permutations and Dyck paths to determine the Eulerian dis- tribution over the set Sn(123) of 123-avoiding permutations in Sn. In

Refining Enumeration Schemes to Count According to Permutation Statistics

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.

Permutations with Restricted Patterns and Dyck Paths

Using this bijection, it is shown that all the recently discovered results on generating functions for 132-avoiding permutations with a given number of occurrences of the pattern 12...k follow directly from old results on the enumeration of Motzkin paths, among which is a continued fraction result due to Flajolet.

Counting consecutive pattern matches in Sn(132) and Sn(123)

Refined Restricted Permutations Avoiding Subsets of Patterns of Length Three

Abstract. Define $ S \limits_{n}^{k} (T) $ to be the set of permutations of {1,2,...,n} with exactly k fixed points which avoid all patterns in $ T \subseteq S_m $. We enumerate $ S \limits_{n}^{k}

The encyclopedia of integer sequences

This book presents methods for Computer Investigation of Sequences, a method for hand analysis of sequences, and some of the methods used in this work, as well as suggestions for further study.

Refined Restricted Permutations

Abstract. Define $ S_{k}^n (\alpha) $ to be the set of permutations of {1, 2,...,n} with exactly k fixed points which avoid the pattern $ \alpha\in S_m $. Let $ S_{k}^n (\alpha) $ be the size of $

On the eulerian numbers