2016
DOI: 10.37236/5908
|View full text |Cite
|
Sign up to set email alerts
|

The Peak Statistics on Simsun Permutations

Abstract: In this paper, we study the relationship among left peaks, interior peaks and updown runs of simsun permutations. Properties of the generating polynomials, including the recurrence relation, generating function and real-rootedness are studied. Moreover, we introduce and study simsun permutations of the second kind.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
7
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
2

Relationship

3
4

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 17 publications
0
7
0
Order By: Relevance
“…Simsun permutations are useful in describing the action of the symmetric group on the maximal chains of the partition lattice (see [35,36]). There has been much recent work devoted to simsun permutation and its variations, see [11,24] and references therein.…”
Section: The G-index Of Young Tableauxmentioning
confidence: 99%
“…Simsun permutations are useful in describing the action of the symmetric group on the maximal chains of the partition lattice (see [35,36]). There has been much recent work devoted to simsun permutation and its variations, see [11,24] and references therein.…”
Section: The G-index Of Young Tableauxmentioning
confidence: 99%
“…For example, (1,6,5,3,4)(2) is not a simsun permutation of the second kind since when we remove the letters 5 and 6, the resulting permutation (1,3,4)(2) contains the cycle double ascent 3. Let SS n be the set of the simsun permutations of the second kind of length n. It follows from [24,Eq. (18)] that…”
Section: Introductionmentioning
confidence: 99%
“…Simsun permutations are a variant of the André permutations of Foata and Schützenberger [9]. We refer the reader to [3,5,6,10,11] for some recent results related to simsun permutations.…”
Section: Introductionmentioning
confidence: 99%
“…There have been extensive studies of the descent polynomials for simsun permutations (see [5,11] for instance). Let S n (x) = π∈RSn x des A (π) , where des A (π) = |{i ∈ [n − 1] : π(i) > π(i + 1)}|.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation