Corpus ID: 235458407

# Efficient recurrence for the enumeration of permutations with fixed pinnacle set

@inproceedings{Fang2021EfficientRF,
title={Efficient recurrence for the enumeration of permutations with fixed pinnacle set},
author={W. Fang},
year={2021}
}
Initiated by Davis, Nelson, Petersen and Tenner (2018), the enumerative study of pinnacle sets of permutations has attracted a fair amount of attention recently. In this article, we provide a recurrence that can be used to compute efficiently the number |Sn(P)| of permutations of size n with a given pinnacle set P, with arithmetic complexity O(k4 + k log n) for P of size k. A symbolic expression can also be computed in this way for pinnacle sets of fixed size. A weighted sum qn(P) of |Sn(P… Expand
1 Citations

#### Figures from this paper

Pinnacle sets revisited
• Mathematics
• 2021
In 2017, Davis, Nelson, Petersen, and Tenner [Discrete Math. 341 (2018),3249–3270] initiated the combinatorics of pinnacles in permutations. We provide a simple and efficient recursion to computeExpand

#### References

SHOWING 1-10 OF 14 REFERENCES
A formula for enumerating permutations with a fixed pinnacle set
• Computer Science, Mathematics
• Discret. Math.
• 2021
A group action defined by Foata and Strehl is adapted to provide a way to generate all permutations with a given pinnacle set, answering a question posed by Davis, Nelson, Petersen, and Tenner. Expand
Pinnacle Set Properties
• Mathematics
• 2021
Let π = π1π2 . . . πn be a permutation in the symmetric group Sn written in one-line notation. The pinnacle set of π, denoted Pin π, is the set of all πi such that πi−1 < πi > πi+1. This is anExpand
Pinnacle sets revisited
• Mathematics
• 2021
In 2017, Davis, Nelson, Petersen, and Tenner [Discrete Math. 341 (2018),3249–3270] initiated the combinatorics of pinnacles in permutations. We provide a simple and efficient recursion to computeExpand
The pinnacle set of a permutation
• Mathematics, Computer Science
• Discret. Math.
• 2018
This article looks at a natural analogue of the peak set of a permutation, instead recording the values of the peaks, and characterize admissible pinnacle sets and study various enumerative questions related to these objects. Expand
Sorting Permutations with Fixed Pinnacle Set
• I. Rusu
• Mathematics, Computer Science
• Electron. J. Comb.
• 2020
It is shown that $\ pi may be sorted by balanced reversals (i.e. transformed into a standard permutation$\Id_S$), implying that$\pi$may be transformed into$\pi'$using at most$4n-2\min\{p,3\}$balanced reversals, where$p=|S|\geq 1\$. Expand
Permutations selon leurs pics, creux, doubles montées et double descentes, nombres d'euler et nombres de Genocchi
• Computer Science, Mathematics
• Discret. Math.
• 1979
It is shown that the type of a permutation on n letters is caracterized by a map @c[n]->[n], and the number of possible types is the Catalan number. Expand
Combinatorial aspects of continued fractions
• P. Flajolet
• Computer Science, Mathematics
• Discret. Math.
• 1980
We show that the universal continued fraction of the Stieltjes-Jacobi type is equivalent to the characteristic series of labelled paths in the plane. The equivalence holds in the set of series inExpand
The Art in Computer Programming
• Computer Science
• 2001
Here the authors haven’t even started the project yet, and already they’re forced to answer many questions: what will this thing be named, what directory will it be in, what type of module is it, how should it be compiled, and so on. Expand
2 ,
Since 2001, we have observed the central region of our Galaxy with the near-infrared (J, H, and Ks) camera SIRIUS and the 1.4 m telescope IRSF. Here I present the results about the infraredExpand