arXiv subjects

Zhicong Lin

Publications and source records attributed to Zhicong Lin.

At least 37 records · Page 2Linked to original sources

arXiv2022

A bijection for length-$5$ patterns in permutations

A bijection between $(31245,32145,31254,32154)$-avoiding permutations and $(31425,32415,31524,32514)$-avoiding permutations is constructed, which preserves five classical set-valued statistics. Combining with two codings of permutations due respectively to Baril--Vajnovszki and Martinez--Savage proves an enumerative conjecture posed by Gao and Kitaev. Moreover, the generating function for the common counting sequence is proved to be algebraic.

math.CO↗

arXiv2022

Burstein's permutation conjecture, Hong and Li's inversion sequence conjecture, and restricted Eulerian distributions

Recently, Hong and Li launched a systematic study of length-four pattern avoidance in inversion sequences, and in particular, they conjectured that the number of $0021$-avoiding inversion sequences can be enumerated by the OEIS entry A218225. Meanwhile, Burstein suggested that the same sequence might also count three sets of pattern restricted permutations. The objective of this paper is not only a confirmation of Hong and Li's conjecture and Burstein's first conjecture, but also two more delicate generating function identities with the $\mathsf{ides}$ statistic concerned in the restricted permutation case, and the $\mathsf{asc}$ statistic concerned in the restricted inversion sequence case, which yield a new equidistribution result.

math.CO↗

arXiv2022

Combinatorics of Integer Partitions With Prescribed Perimeter

We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We generalize the two concerned statistics to these of the part-difference less than $d$ and the parts not congruent to $1$ modulo $d+1$ and prove a distribution inequality, that has a similar flavor as Alder's ex-conjecture, over partitions with a prescribed perimeter. Both of our results are proved analytically and combinatorially.

math.CO↗

arXiv2021

Proof of Dilks' bijectivity conjecture on Baxter permutations

Baxter permutations originally arose in studying common fixed points of two commuting continuous functions. In 2015, Dilks proposed a conjectured bijection between Baxter permutations and non-intersecting triples of lattice paths in terms of inverse descent bottoms, descent positions and inverse descent tops. We prove this bijectivity conjecture by investigating its connection with the Françon--Viennot bijection. As a result, we obtain a permutation interpretation of the $(t,q)$-analog of the Baxter numbers $$ \frac{1}{{n+1\brack 1}_q{n+1\brack 2}_q}\sum_{k=0}^{n-1}q^{3{k+1\choose2}}{n+1\brack k}_q{n+1\brack k+1}_q{n+1\brack k+2}_qt^k, $$ where ${n\brack k}_q$ denote the $q$-binomial coefficients.

math.CO↗

arXiv2021

Combinatorics of the symmetries of ascents in restricted inversion sequences

The systematic study of inversion sequences avoiding triples of relations was initiated by Martinez and Savage. For a triple $(ρ_1,ρ_2,ρ_3)\in\{<,>,\leq,\geq,=,\neq,-\}^3$, they introduced $\I_n(ρ_1,ρ_2,ρ_3)$ as the set of inversion sequences $e=e_1e_2\cdots e_n$ of length $n$ such that there are no indices $1\leq i )$ and $\I_n(>,\neq,\geq)$ that preserves the distinct entries and further posed a symmetry conjecture of ascents on these two classes of restricted inversion sequences. Concerning Lin's symmetry conjecture, an algebraic proof using the kernel method was recently provided by Andrews and Chern, but a bijective proof still remains mysterious. The goal of this article is to establish bijectively both Lin's symmetry conjecture and the $γ$-positivity of the ascent polynomial on $\I_n(>,\neq,>)$. The latter result implies that the distribution of ascents on $\I_n(>,\neq,>)$ is symmetric and unimodal.

math.CO↗

arXiv2021

A combinatorial bijection on di-sk trees

A di-sk tree is a rooted binary tree whose nodes are labeled by $\oplus$ or $\ominus$, and no node has the same label as its right child. The di-sk trees are in natural bijection with separable permutations. We construct a combinatorial bijection on di-sk trees proving the two quintuples $(\LMAX,\LMIN,\DESB,\iar,\comp)$ and $(\LMAX,\LMIN,\DESB,\comp,\iar)$ have the same distribution over separable permutations. Here for a permutation $π$, $\LMAX(π)/\LMIN(π)$ is the set of values of the left-to-right maxima/minima of $π$ and $\DESB(π)$ is the set of descent bottoms of $π$, while $\comp(π)$ and $\iar(π)$ are respectively the number of components of $π$ and the length of initial ascending run of $π$. Interestingly, our bijection specializes to a bijection on $312$-avoiding permutations, which provides (up to the classical {\em Knuth--Richards bijection}) an alternative approach to a result of Rubey (2016) that asserts the two triples $(\LMAX,\iar,\comp)$ and $(\LMAX,\comp,\iar)$ are equidistributed on $321$-avoiding permutations. Rubey's result is a symmetric extension of an equidistribution due to Adin--Bagno--Roichman, which implies the class of $321$-avoiding permutations with a prescribed number of components is Schur positive. Some equidistribution results for various statistics concerning tree traversal are presented in the end.

math.CO↗

arXiv2021

A symmetry on weakly increasing trees and multiset Schett polynomials

By considering the parity of the degrees and levels of nodes in increasing trees, a new combinatorial interpretation for the coefficients of the Taylor expansions of the Jacobi elliptic functions is found. As one application of this new interpretation, a conjecture of Ma-Mansour-Wang-Yeh is solved. Unifying the concepts of increasing trees and plane trees, Lin-Ma-Ma-Zhou introduced weakly increasing trees on a multiset. A symmetry joint distribution of "even-degree nodes on odd levels" and "odd-degree nodes" on weakly increasing trees is found, extending the Schett polynomials, a generalization of the Jacobi elliptic functions introduced by Schett, to multisets. A combinatorial proof and an algebraic proof of this symmetry are provided, as well as several relevant interesting consequences. Moreover, via introducing a group action on trees, we prove the partial $γ$-positivity of the multiset Schett polynomials, a result implies both the symmetry and the unimodality of these polynomials.

math.CO↗

arXiv2021

Cycles on a multiset with only even-odd drops

For a finite subset $A$ of $\mathbb{Z}_{>0}$, Lazar and Wachs (2019) conjectured that the number of cycles on $A$ with only even-odd drops is equal to the number of D-cycles on $A$. In this note, we introduce cycles on a multiset with only even-odd drops and prove bijectively a multiset version of their conjecture. As a consequence, the number of cycles on $[2n]$ with only even-odd drops equals the Genocchi number $g_n$. With Laguerre histories as an intermediate structure, we also construct a bijection between a class of permutations of length $2n-1$ known to be counted by $g_n$ invented by Dumont and the cycles on $[2n]$ with only even-odd drops.

math.CO↗

arXiv2021

A decomposition of ballot permutations, pattern avoidance and Gessel walks

A permutation whose any prefix has no more descents than ascents is called a ballot permutation. In this paper, we present a decomposition of ballot permutations that enables us to construct a bijection between ballot permutations and odd order permutations, which proves a set-valued extension of a conjecture due to Spiro using the statistic of peak values. This bijection also preserves the neighbors of the largest letter in permutations and thus resolves a refinement of Spiro' s conjecture proposed by Wang and Zhang. Our decomposition can be extended to well-labelled positive paths, a class of generalized ballot permutations arising from polytope theory, that were enumerated by Bernardi, Duplantier and Nadeau. We will also investigate the enumerative aspect of ballot permutations avoiding a single pattern of length 3 and establish a connection between 213-avoiding ballot permutations and Gessel walks.

math.CO↗

arXiv2020

Positivity and divisibility of alternating descent polynomials

The alternating descent statistic on permutations was introduced by Chebikin as a variant of the descent statistic. We show that the alternating descent polynomials on permutations are unimodal via a five-term recurrence relation. We also found a quadratic recursion for the alternating major index $q$-analog of the alternating descent polynomials. As an interesting application of this quadratic recursion, we show that $(1+q)^{\lfloor n/2\rfloor}$ divides $\sum_{π\in\mathfrak{S}_n}q^{\rm{altmaj}(π)}$, where $\mathfrak{S}_n$ is the set of all permutations of $\{1,2,\ldots,n\}$ and $\rm{altmaj}(π)$ is the alternating major index of $π$. This leads us to discover a $q$-analog of $n!=2^{\ell}m$, $m$ odd, using the statistic of alternating major index. Moreover, we study the $γ$-vectors of the alternating descent polynomials by using these two recursions and the ${\textbf{cd}}$-index. Further intriguing conjectures are formulated, which indicate that the alternating descent statistic deserves more work.

math.CO↗

arXiv2020

Refined Wilf-equivalences by Comtet statistics

We launch a systematic study of the refined Wilf-equivalences by the statistics $\mathsf{comp}$ and $\mathsf{iar}$, where $\mathsf{comp}(π)$ and $\mathsf{iar}(π)$ are the number of components and the length of the initial ascending run of a permutation $π$, respectively. As Comtet was the first one to consider the statistic $\mathsf{comp}$ in his book {\em Analyse combinatoire}, any statistic equidistributed with $\mathsf{comp}$ over a class of permutations is called by us a {\em Comtet statistic} over such class. This work is motivated by a triple equidistribution result of Rubey on $321$-avoiding permutations, and a recent result of the first and third authors that $\mathsf{iar}$ is a Comtet statistic over separable permutations. Some highlights of our results are: (1) Bijective proofs of the symmetry of the double Comtet distribution $(\mathsf{comp},\mathsf{iar})$ over several Catalan and Schröder classes, preserving the values of the left-to-right maxima. (2) A complete classification of $\mathsf{comp}$- and $\mathsf{iar}$-Wilf-equivalences for length $3$ patterns and pairs of length $3$ patterns. Calculations of the $(\mathsf{des},\mathsf{iar},\mathsf{comp})$ generating functions over these pattern avoiding classes and separable permutations. (3) A further refinement by the Comtet statistic $\mathsf{iar}$, of Wang's recent descent-double descent-Wilf equivalence between separable permutations and $(2413,4213)$-avoiding permutations.

math.CO↗

arXiv2020

Signed Euler-Mahonian identities

A relationship between signed Eulerian polynomials and the classical Eulerian polynomials on $\mathfrak{S}_n$ was given by Désarménien and Foata in 1992, and a refined version, called signed Euler-Mahonian identity, together with a bijective proof were proposed by Wachs in the same year. By generalizing this bijection, in this paper we extend the above results to the Coxeter groups of types $B_n$, $D_n$, and the complex reflection group $G(r,1,n)$, where the `sign' is taken to be any one-dimensional character. Some obtained identities can be further restricted on some particular set of permutations. We also derive some new interesting sign-balance polynomials for types $B_n$ and $D_n$.

math.CO↗

arXiv2020

Inversion sequences avoiding pairs of patterns

The enumeration of inversion sequences avoiding a single pattern was initiated by Corteel--Martinez--Savage--Weselcouch and Mansour--Shattuck independently. Their work has sparked various investigations of generalized patterns in inversion sequences, including patterns of relation triples by Martinez and Savage, consecutive patterns by Auli and Elizalde, and vincular patterns by Lin and Yan. In this paper, we carried out the systematic study of inversion sequences avoiding two patterns of length $3$. Our enumerative results establish further connections to the OEIS sequences and some classical combinatorial objects, such as restricted permutations, weighted ordered trees and set partitions. Since patterns of relation triples are some special multiple patterns of length $3$, our results complement the work by Martinez and Savage. In particular, one of their conjectures regarding the enumeration of $(021,120)$-avoiding inversion sequences is solved.

math.CO↗

arXiv2020

Around the $q$-binomial-Eulerian polynomials

We find a combinatorial interpretation of Shareshian and Wachs' $q$-binomial-Eulerian polynomials, which leads to an alternative proof of their $q$-$γ$-positivity using group actions. Motivated by the sign-balance identity of Désarménien--Foata--Loday for the $(\mathrm{des}, \mathrm{inv})$-Eulerian polynomials, we further investigate the sign-balance of the $q$-binomial-Eulerian polynomials. We show the unimodality of the resulting signed binomial-Eulerian polynomials by exploiting their continued fraction expansion and making use of a new quadratic recursion for the $q$-binomial-Eulerian polynomials. We finally use the method of continued fractions to derive a new $(p,q)$-extension of the $γ$-positivity of binomial-Eulerian polynomials which involves crossings and nestings of permutations.

math.CO↗

arXiv2020

Plateaux on generalized Stirling permutations and partial $γ$-positivity

We prove that the enumerative polynomials of generalized Stirling permutations by the statistics of plateaux, descents and ascents are partial $γ$-positive. Specialization of our result to the Jacobi-Stirling permutations confirms a recent partial $γ$-positivity conjecture due to Ma, Yeh and the second named author. Our partial $γ$-positivity expansion, as well as a combinatorial interpretation for the corresponding $γ$-coefficients, are obtained via the machine of context-free grammars and a group action on generalized Stirling permutations. Besides, we also provide an alternative approach to the partial $γ$-positivity from the stability of certain multivariate polynomials.

math.CO↗

arXiv2020

$k$-arrangements, statistics and patterns

The $k$-arrangements are permutations whose fixed points are $k$-colored. We prove enumerative results related to statistics and patterns on $k$-arrangements, confirming several conjectures by Blitvić and Steingrímsson. In particular, one of their conjectures regarding the equdistribution of the number of descents over the derangement form and the permutation form of $k$-arrangements is strengthened in two interesting ways. Moreover, as one application of the so-called Decrease Value Theorem, we calculate the generating function for a symmetric pair of Eulerian statistics over permutations arising in our study.

math.CO↗

arXiv2020

On $\underline{12}0$-avoiding inversion and ascent sequences

Recently, Yan and the first named author investigated systematically the enumeration of inversion or ascent sequences avoiding vincular patterns of length $3$, where two of the three letters are required to be adjacent. They established many connections with familiar combinatorial families and proposed several interesting conjectures. The objective of this paper is to address two of their conjectures concerning the enumeration of $\underline{12}0$-avoiding inversion or ascent sequences.

math.CO↗

arXiv2020

Refined restricted inversion sequences

Recently, the study of patterns in inversion sequences was initiated by Corteel-Martinez-Savage-Weselcouch and Mansour-Shattuck independently. Motivated by their works and a double Eulerian equidistribution due to Foata (1977), we investigate several classical statistics on restricted inversion sequences that are either known or conjectured to be enumerated by {\em Catalan}, {\em Large Schröder}, {\em Baxter} and {\em Euler} numbers. One of the two highlights of our results is a fascinating bijection between $000$-avoiding inversion sequences and Simsun permutations, which together with Foata's V- and S-codes, provide a proof of a restriced double Eulerian equdistribution. The other one is a refinement of a conjecture due to Martinez and Savage that the cardinality of $\I_n(\geq,\geq,>)$ is the $n$-th Baxter number, which is proved via the so-called {\em obstinate kernel method} developed by Bousquet-Mélou.

math.CO↗