Pattern statistics in faro words and permutations

@article{Baril2021PatternSI,
  title={Pattern statistics in faro words and permutations},
  author={Jean-Luc Baril and Alexander Burstein and Sergey Kirgizov},
  journal={Discret. Math.},
  year={2021},
  volume={344},
  pages={112464}
}
We study the distribution and the popularity of some patterns in words obtained by interlacing the letters of the two nondecreasing $k$-ary words of lengths differing by at most one. We present a bijection between these words and dispersed Dyck paths with a given number of peaks. We show how the bijection maps statistics of consecutive patterns into linear combinations of other pattern statistics on paths. We deduce enumerative results by providing multivariate generating functions for the… Expand

Figures and Tables from this paper

References

SHOWING 1-10 OF 35 REFERENCES
Expected Patterns in Permutation Classes
TLDR
This paper examines the class of permutations avoiding the pattern 132, and gives exact formula for the occurrences of each length 3 pattern, and proves that the number of 231 patterns is the same in each. Expand
Popularity of patterns over d-equivalence classes of words and permutations
TLDR
It is shown the far-from-trivial fact that two patterns are d-equivalent if and only if they are equipopular over any $d$-equivalence class, and this equipopularity does not follow obviously from a trivial equidistribution. Expand
Permutations with Restricted Patterns and Dyck Paths
TLDR
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. Expand
Analytic Combinatorics of Lattice Paths with Forbidden Patterns, the Vectorial Kernel Method, and Generating Functions for Pushdown Automata
TLDR
A vectorial kernel method is developed which solves in a unified framework all the problems related to the enumeration of words generated by a pushdown automaton for the enumerations of lattice paths that avoid a fixed word (a pattern), or for counting the occurrences of a given pattern. Expand
Patterns in Permutations and Words
  • S. Kitaev
  • Mathematics, Computer Science
  • Monographs in Theoretical Computer Science. An EATCS Series
  • 2011
TLDR
The author collects the main results in the field in this up-to-date, comprehensive reference volume and highlights significant achievements in the area, and points to research directions and open problems. Expand
Restricted Dumont permutations, Dyck paths, and noncrossing partitions
TLDR
This work enumerates Dumont permutations of the first kind simultaneously avoiding certain pairs of 4-letter patterns and another pattern of arbitrary length. Expand
Enumeration of the distinct shuffles of permutations
A shuffle of two words is a word obtained by concatenating the two original words in either order and then sliding any letters from the second word back past letters of the first word, in such a wayExpand
Distribution of peak heights modulo $k$ and double descents on $k$-Dyck paths.
We show that the distribution of the number of peaks at height $i$ modulo $k$ in $k$-Dyck paths of a given length is independent of $i\in[0,k-1]$ and is the reversal of the distribution of the totalExpand
Counting Ascents in Generalized Dyck Paths
TLDR
This work studies the asymptotic behavior of the number of ascents of given length for classical subfamilies of general non-negative Lukasiewicz paths: those with arbitrary ending altitude, those ending on their starting altitude, and a variation thereof. Expand
Statistics on Dyck Paths
In this paper we consider several statistics on the set of Dyck paths. Enumeration of Dyck paths according to length and various other parameters has been studied in several papers. However, theExpand
...
1
2
3
4
...