Open AccessCounting Permutations by Simsun Successions
Author(s) -
Yen-chi Roger Lin,
Shi-Mei Ma,
Yeong-Nan Yeh
Publication year - 2018
Publication title -
taiwanese journal of mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.529
H-Index - 46
eISSN - 2224-6851
pISSN - 1027-5487
DOI - 10.11650/tjm/180701
Subject(s) - bijection , mathematics , combinatorics , set (abstract data type) , eulerian path , discrete mathematics , pure mathematics , computer science , lagrangian , programming language
In this paper, we introduce the definitions of simsun succession statistics and simsun patterns. In addition to its original definition by Brenti, we give two more combinatorial interpretations of the q-Eulerian polynomials using simsun successions. We also present a bijection between permutations avoiding the simsun pattern 132 and set partitions.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom