Pattern-functions, statistics, and shallow permutations

DOI10.37236/10858MaRDI QIDQ2112582zbMATH OpenOpenAlexFDO

Authors Yosef Berman, Bridget Eileen Tenner

Publication date 11 January 2023

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2110.11146

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

arrow patternspattern-functionspermutation statistics

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Combinatorial probability (60C05) Central limit and other weak theorems (60F05)

Abstract: We study relationships between permutation statistics and pattern-functions, counting the number of times particular patterns occur in a permutation. This allows us to write several familiar statistics as linear combinations of pattern counts, both in terms of a permutation and in terms of its image under the fundamental bijection. We use these enumerations to resolve the question of characterizing so-called "shallow" permutations, whose depth (equivalently, disarray/displacement) is minimal with respect to length and reflection length. We present this characterization in several ways, including vincular patterns, mesh patterns, and a new object that we call "arrow patterns." Furthermore, we specialize to characterizing and enumerating shallow involutions and shallow cycles, encountering the Motzkin and large Schr"oder numbers, respectively.

Review text

Summary: We study relationships between permutation statistics and pattern-functions, counting the number of times particular patterns occur in a permutation. This allows us to write several familiar statistics as linear combinations of pattern counts, both in terms of a permutation and in terms of its image under the fundamental bijection. We use these enumerations to resolve the question of characterizing so-called ``shallow permutations, whose depth (equivalently, disarray/displacement) is minimal with respect to length and reflection length. We present this characterization in several ways, including vincular patterns, mesh patterns, and a new object that we call ``arrow patterns. Furthermore, we specialize to characterizing and enumerating shallow involutions and shallow cycles, encountering the Motzkin and large Schröder numbers, respectively.

Recommendations

• Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
• Generalized permutation patterns and a classification of the Mahonian statistics
• Distributions of mesh patterns of short lengths
• The depth of a permutation.
• Permutation statistics and multiple pattern avoidance

Cites work

• A short proof for the number of permutations containing pattern 321 exactly once
• Coincidence among families of mesh patterns
• Coincidental pattern avoidance
• Diameters of graphs of reduced words and rank-two root subsystems
• Generalized permutation patterns and a classification of the Mahonian statistics
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 1375582 (Why is no real title available?)
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• scientific article; zbMATH DE number 3584785 (Why is no real title available?)
• scientific article; zbMATH DE number 1033192 (Why is no real title available?)
• Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
• Mesh patterns with superfluous mesh
• Patterns in permutations and words.
• Permutation patterns and continued fractions
• Permutations with one or two 132-subsequences
• Repetition in reduced decompositions
• Stable characters from permutation patterns
• The depth of a permutation.
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• The number of permutations containing exactly one increasing subsequence of length three
• The number of permutations with exactly \(r\) 132-subsequences is \(P\)-recursive in the size!
• The range of repetition in reduced decompositions
• Unknotted cycles

Cited in

(9)

• Shuffle-compatible permutation statistics. II: The exterior peak set
• The depth of a permutation.
• Pattern statistics and Vandermonde matrices.
• scientific article; zbMATH DE number 5870282 (Why is no real title available?)
• Prism permutations in the Bruhat order
• Cyclic permutations avoiding patterns in both one-line and cycle forms
• Characterizing avoidance in cycles via vincular patterns
• Pattern avoidance and the fundamental bijection
• Pattern-restricted one-cycle permutations with a pattern-restricted cycle form

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Pattern-functions, statistics, and shallow permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2112582)