Zhicong Lin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zhicong Lin has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Shishuo Fu
College of Mathematics and Statistics, Chongqing University, Chongqing, People’s Republic of China
7 shared publications - David G. L. Wang
School of Mathematics and Statistics & Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, Key Laboratory of Mathematical Theory and Computation on Information Security, Ministry of Industry and Information Technology, Beijing, People’s Republic of China
4 shared publications - Dongsu Kim
Department of Mathematical Sciences, Korea Advanced Institute of Science and Technology, Daejeon, Republic of Korea
4 shared publications Yang Li
4 shared publicationsJing Liu
Research Center for Mathematics and Interdisciplinary Sciences Shandong University 266237 Qingdao P.R. China
3 shared publications- Qiongqiong Pan
College of Mathematics and Physics, Wenzhou University, Wenzhou, People’s Republic of China
3 shared publications
Latest Publications
- 2 November 2026
- Published by Springer Nature in Annals of Combinatorics
- p. 1-19
A Bijection Between 321- and 213-Avoiding Permutations Preserving t-Stack-Sortability
- 2 November 2026
- Published by Springer Nature in Annals of Combinatorics
- p. 1-19
A Bijection Between 321- and 213-Avoiding Permutations Preserving t-Stack-Sortability
- Open Access
Proof of a Conjecture on Young Tableaux with Walls
Banderier, Marchal, and Wallner considered Young tableaux with walls, which are similar to standard Young tableaux, except that local decreases are allowed at some walls. In this work, we prove a conjecture of Fuchs and Yu concerning the enumeration of two classes of three-row Young tableaux with walls. Combining with the work by Chang, Fuchs, Liu, Wallner, and Yu leads to the verification of a conjecture on tree-child networks proposed by Pons and Batle. This conjecture was regarded as a specific and challenging problem in the Phylogenetics community until it was finally resolved by the present work.
Open AccessProof of a Conjecture on Young Tableaux with Walls
Banderier, Marchal, and Wallner considered Young tableaux with walls, which are similar to standard Young tableaux, except that local decreases are allowed at some walls. In this work, we prove a conjecture of Fuchs and Yu concerning the enumeration of two classes of three-row Young tableaux with walls. Combining with the work by Chang, Fuchs, Liu, Wallner, and Yu leads to the verification of a conjecture on tree-child networks proposed by Pons and Batle. This conjecture was regarded as a specific and challenging problem in the Phylogenetics community until it was finally resolved by the present work.
- Open Access
- 20 December 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 42 (1) , 10
Correction: Callan permutations and odd order permutations
- 20 December 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 42 (1) , 10
Open AccessCorrection: Callan permutations and odd order permutations
- Open Access
An involution for a Catalan-tangent number identity
We provide an involution proof of a Catalan-tangent number identity arising from the study of peak algebra that was found by Aliniaeifard and Li. In the course, we find a new combinatorial identity for the tangent numbers $T_{2n+1}$: $$ \sum_{k=0}^{n}(-1)^{k}{2n+1\choose 2k}2^{2n-2k}T_{2k+1}=(-1)^nT_{2n+1}. $$ Moreover, we derive two different $q$-analogs of the above identity from the combinatorial perspective.Open AccessAn involution for a Catalan-tangent number identity
We provide an involution proof of a Catalan-tangent number identity arising from the study of peak algebra that was found by Aliniaeifard and Li. In the course, we find a new combinatorial identity for the tangent numbers $T_{2n+1}$: $$ \sum_{k=0}^{n}(-1)^{k}{2n+1\choose 2k}2^{2n-2k}T_{2k+1}=(-1)^nT_{2n+1}. $$ Moreover, we derive two different $q$-analogs of the above identity from the combinatorial perspective. - 30 October 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (6) , 1-11
Callan permutations and odd order permutations
- 30 October 2025
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 41 (6) , 1-11
Callan permutations and odd order permutations
- Open Access
A bijection between $321$- and $213$-avoiding permutations preserving $t$-stack-sortability
We construct a bijection between $321$- and $213$-avoiding permutations that preserves the property of $t$-stack-sortability. Our bijection transforms natural statistics between these two classes of permutations and proves a refinement of an enumerative conjecture posed by Zhang and Kitaev. This work contributes further to the long-standing line of research on bijections between length-3 pattern avoiding permutations. Increasing binary trees lie at the heart of our approach.
Open AccessA bijection between $321$- and $213$-avoiding permutations preserving $t$-stack-sortability
We construct a bijection between $321$- and $213$-avoiding permutations that preserves the property of $t$-stack-sortability. Our bijection transforms natural statistics between these two classes of permutations and proves a refinement of an enumerative conjecture posed by Zhang and Kitaev. This work contributes further to the long-standing line of research on bijections between length-3 pattern avoiding permutations. Increasing binary trees lie at the heart of our approach.
- Open Access
Bijections in weakly increasing trees via binary trees
As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we construct four bijections on weakly increasing trees in the same flavor via switching the role of left child and right child of some specified nodes in their corresponding binary trees. Consequently, bijective proofs of the aforementioned symmetries found by Dong et al. and a non-recursive construction of a bijection on plane trees of Deutsch are provided. Applications of some symmetries in weakly increasing trees to permutation patterns and statistics will also be discussed.
Open AccessBijections in weakly increasing trees via binary trees
As a unification of increasing trees and plane trees, the weakly increasing trees labeled by a multiset was introduced by Lin-Ma-Ma-Zhou in 2021. Motived by some symmetries in plane trees proved recently by Dong, Du, Ji and Zhang, we construct four bijections on weakly increasing trees in the same flavor via switching the role of left child and right child of some specified nodes in their corresponding binary trees. Consequently, bijective proofs of the aforementioned symmetries found by Dong et al. and a non-recursive construction of a bijection on plane trees of Deutsch are provided. Applications of some symmetries in weakly increasing trees to permutation patterns and statistics will also be discussed.
- Open Access
Web permutations, Seidel triangle and normalized $γ$-coefficients
The web permutations were introduced by Hwang, Jang and Oh to interpret the entries of the transition matrix between the Specht and $\mathrm{SL}_2$-web bases of the irreducible $§_{2n}$-representation indexed by $(n,n)$. They conjectured that certain classes of web permutations are enumerated by the Seidel triangle. Using generating functions, Xu and Zeng showed that enumerating web permutations by the number of drops, fixed points and cycles gives rise to the normalized $γ$-coefficients of the $(α,t)$-Eulerian polynomials. They posed the problems to prove their result combinatorially and to find an interpretation of the normalized $γ$-coefficients in terms of cycle-up-down permutations. In this work, we prove the enumerative conjecture of Hwang-Jang-Oh and answer the two open problems proposed by Xu and Zeng.Open AccessWeb permutations, Seidel triangle and normalized $γ$-coefficients
The web permutations were introduced by Hwang, Jang and Oh to interpret the entries of the transition matrix between the Specht and $\mathrm{SL}_2$-web bases of the irreducible $§_{2n}$-representation indexed by $(n,n)$. They conjectured that certain classes of web permutations are enumerated by the Seidel triangle. Using generating functions, Xu and Zeng showed that enumerating web permutations by the number of drops, fixed points and cycles gives rise to the normalized $γ$-coefficients of the $(α,t)$-Eulerian polynomials. They posed the problems to prove their result combinatorially and to find an interpretation of the normalized $γ$-coefficients in terms of cycle-up-down permutations. In this work, we prove the enumerative conjecture of Hwang-Jang-Oh and answer the two open problems proposed by Xu and Zeng. - Open Access
Combinatorics on bi-$γ$-positivity of $1/k$-Eulerian polynomials
The $1/k$-Eulerian polynomials $A^{(k)}_{n}(x)$ were introduced as ascent polynomials over $k$-inversion sequences by Savage and Viswanathan. The bi-$γ$-positivity of the $1/k$-Eulerian polynomials $A^{(k)}_{n}(x)$ was known but to give a combinatorial interpretation of the corresponding bi-$γ$-coefficients still remains open. The study of the theme of bi-$γ$-positivities from purely combinatorial aspect was proposed by Athanasiadis. In this paper, we provide a combinatorial interpretation for the bi-$γ$-coefficients of $A^{(k)}_{n}(x)$ by using the model of certain ordered labeled forests. Our combinatorial approach consists of three main steps: (i) construct a bijection between $k$-Stirling permutations and certain forests that are named increasing pruned even $k$-ary forests; (ii) introduce a generalized Foata--Strehl action on increasing pruned even $k$-ary trees which implies the longest ascent-plateau polynomials over $k$-Stirling permutations with initial letter $1$ are $γ$-positive, a result that may have independent interest; (iii) develop two crucial transformations on increasing pruned even $k$-ary forests to conclude our combinatorial interpretation.Open AccessCombinatorics on bi-$γ$-positivity of $1/k$-Eulerian polynomials
The $1/k$-Eulerian polynomials $A^{(k)}_{n}(x)$ were introduced as ascent polynomials over $k$-inversion sequences by Savage and Viswanathan. The bi-$γ$-positivity of the $1/k$-Eulerian polynomials $A^{(k)}_{n}(x)$ was known but to give a combinatorial interpretation of the corresponding bi-$γ$-coefficients still remains open. The study of the theme of bi-$γ$-positivities from purely combinatorial aspect was proposed by Athanasiadis. In this paper, we provide a combinatorial interpretation for the bi-$γ$-coefficients of $A^{(k)}_{n}(x)$ by using the model of certain ordered labeled forests. Our combinatorial approach consists of three main steps: (i) construct a bijection between $k$-Stirling permutations and certain forests that are named increasing pruned even $k$-ary forests; (ii) introduce a generalized Foata--Strehl action on increasing pruned even $k$-ary trees which implies the longest ascent-plateau polynomials over $k$-Stirling permutations with initial letter $1$ are $γ$-positive, a result that may have independent interest; (iii) develop two crucial transformations on increasing pruned even $k$-ary forests to conclude our combinatorial interpretation. - Open Access
Bijections around Springer numbers
Arnol'd proved in 1992 that Springer numbers enumerate the Snakes, which are type $B$ analogs of alternating permutations. Chen, Fan and Jia in 2011 introduced the labeled ballot paths and established a ``hard'' bijection with snakes. Callan conjectured in 2012 and Han--Kitaev--Zhang proved recently that rc-invariant alternating permutations are counted by Springer numbers. Very recently, Chen--Fang--Kitaev--Zhang investigated multi-dimensional permutations and proved that weakly increasing $3$-dimensional permutations are also counted by Springer numbers. In this work, we construct a sequence of ``natural'' bijections linking the above four combinatorial objects.Open AccessBijections around Springer numbers
Arnol'd proved in 1992 that Springer numbers enumerate the Snakes, which are type $B$ analogs of alternating permutations. Chen, Fan and Jia in 2011 introduced the labeled ballot paths and established a ``hard'' bijection with snakes. Callan conjectured in 2012 and Han--Kitaev--Zhang proved recently that rc-invariant alternating permutations are counted by Springer numbers. Very recently, Chen--Fang--Kitaev--Zhang investigated multi-dimensional permutations and proved that weakly increasing $3$-dimensional permutations are also counted by Springer numbers. In this work, we construct a sequence of ``natural'' bijections linking the above four combinatorial objects.