A formula for enumerating permutations with a fixed pinnacle set
A formula for enumerating permutations with a fixed pinnacle set
复制标题
具有固定顶峰集的排列排列公式
DOI:
10.1016/j.disc.2021.112375
复制
发表时间:
2021
影响因子:
0.8
通讯作者:
Nilsen, Lars
中科院分区:
文献类型:
--
作者:
Diaz-Lopez, Alexander;Harris, Pamela E.;Huang, Isabella;Insko, Erik;Nilsen, Lars
Abstract In 2017 Davis, Nelson, Petersen, and Tenner pioneered the study of pinnacle sets of permutations and asked whether there exists a class of operations, which applied to a permutation in S n, can produce any other permutation with the same pinnacle set and no others. In this paper, we adapt a group action defined by Foata and Strehl to provide a way to generate all permutations with a given pinnacle set. From this we give an answer to a second question asked by Davis, Nelsen, Peterson, and Tenner, which asks for a closed non-recursive formula enumerating permutations with a given pinnacle set.
DOI:
--
发表时间:
2019
期刊:
European journal of combinatorics (Print)
影响因子:
--
作者:
Christian Gaetz;Yibo Gao
通讯作者:
Yibo Gao
影响因子:
0.8
作者:
Robert Davis;Sarah A. Nelson;T. K. Petersen;B. E. Tenner
通讯作者:
B. E. Tenner
DOI:
--
发表时间:
2012
期刊:
影响因子:
--
作者:
Sara C. Billey;K. Burdzy;B. Sagan
通讯作者:
B. Sagan