HLHsin-Chieh Liao
Hsin-Chieh Liao
*This is an algorithmically generated author record based on publicly available information.
Hsin-Chieh Liao has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Hsiang-Chun Hsu
National Taiwan University
3 shared publications - Tung-Shan Fu
National Pingtung University
3 shared publications - Sen-Peng Eu
Department of Mathematics, National Taiwan Normal University, Taipei, Taiwan, ROC
1 shared publication
Latest Publications
- Open Access
- 1 October 2018
- Published by The Mathematical Society of the Republic of China in Taiwanese Journal of Mathematics
- Vol. 22 (5) , 1031-1050
Folding Phenomenon of Major-balance Identities on Restricted Involutions
Project Euclid - mathematics and statistics online
- 1 October 2018
- Published by The Mathematical Society of the Republic of China in Taiwanese Journal of Mathematics
- Vol. 22 (5) , 1031-1050
Open AccessFolding Phenomenon of Major-balance Identities on Restricted Involutions
Project Euclid - mathematics and statistics online
- Open Access
Signed Countings of types B and D permutations and $t,q$-Euler Numbers
It is a classical result that the parity-balance of the number of weak excedances of all permutations (derangements, respectively) of length $n$ is the Euler number $E_n$, alternating in sign, if $n$ is odd (even, respectively). Josuat-Verg\`{e}s obtained a $q$-analog of the results respecting the number of crossings of a permutation. One of the goals in this paper is to extend the results to the permutations (derangements, respectively) of types B and D, on the basis of the joint distribution in statistics excedances, crossings and the number of negative entries obtained by Corteel, Josuat-Verg\`{e}s and Kim. Springer numbers are analogous Euler numbers that count the alternating permutations of type B, called snakes. Josuat-Verg\`{e}s derived bivariate polynomials $Q_n(t,q)$ and $R_n(t,q)$ as generalized Euler numbers via successive $q$-derivatives and multiplications by $t$ on polynomials in $t$. The other goal in this paper is to give a combinatorial interpretation of $Q_n(t,q)$ and $R_n(t,q)$ as the enumerators of the snakes with restrictions.Open AccessSigned Countings of types B and D permutations and $t,q$-Euler Numbers
It is a classical result that the parity-balance of the number of weak excedances of all permutations (derangements, respectively) of length $n$ is the Euler number $E_n$, alternating in sign, if $n$ is odd (even, respectively). Josuat-Verg\`{e}s obtained a $q$-analog of the results respecting the number of crossings of a permutation. One of the goals in this paper is to extend the results to the permutations (derangements, respectively) of types B and D, on the basis of the joint distribution in statistics excedances, crossings and the number of negative entries obtained by Corteel, Josuat-Verg\`{e}s and Kim. Springer numbers are analogous Euler numbers that count the alternating permutations of type B, called snakes. Josuat-Verg\`{e}s derived bivariate polynomials $Q_n(t,q)$ and $R_n(t,q)$ as generalized Euler numbers via successive $q$-derivatives and multiplications by $t$ on polynomials in $t$. The other goal in this paper is to give a combinatorial interpretation of $Q_n(t,q)$ and $R_n(t,q)$ as the enumerators of the snakes with restrictions. - Open Access
Folding Phenomenon of Major-balance Identities on Restricted Involutions
In this paper we prove a refined major-balance identity on the $321$-avoiding involutions of length $n$, respecting the leading element of permutations. The proof is based on a sign-reversing involution on the lattice paths within a $\lfloor\frac{n}{2}\rfloor\times\lceil\frac{n}{2}\rceil$ rectangle. Moreover, we prove affirmatively a question about refined major-balance identity on the $123$-avoiding involutions, respecting the number of descents.Open AccessFolding Phenomenon of Major-balance Identities on Restricted Involutions
In this paper we prove a refined major-balance identity on the $321$-avoiding involutions of length $n$, respecting the leading element of permutations. The proof is based on a sign-reversing involution on the lattice paths within a $\lfloor\frac{n}{2}\rfloor\times\lceil\frac{n}{2}\rceil$ rectangle. Moreover, we prove affirmatively a question about refined major-balance identity on the $123$-avoiding involutions, respecting the number of descents.