3 citations · 3 across the 8 of their papers we have counts for
10 papers
Shuffle-compatibility for combinatorial statistics on words, parking functions, and set partitions
Spencer Daugherty, Jinting Liang
We introduce notions of (weak) shuffle-compatibility for statistics on words, parking functions, and set partitions, generalizing Gessel and Zhuang's shuffle-compatibility for stat…
Symmetric quasisymmetric Schur-like functions
Maria Esipova, Jinting Liang, Stephanie van Willigenburg
In this paper we classify when (row-strict) dual immaculate functions and (row-strict) extended Schur functions, as well as their skew generalizations, are symmetric. We also class…
Log-concavity and log-convexity via distributive lattices
Jinting Liang, Bruce E. Sagan
We prove a lemma, which we call the Order Ideal Lemma, that can be used to demonstrate a wide array of log-concavity and log-convexity results in a combinatorial manner using order…
Cyclic shuffle-compatibility via cyclic shuffle algebras
Jinting Liang, Bruce E. Sagan, Yan Zhuang
A permutation statistic is said to be shuffle-compatible if the distribution of over the set of shuffles of two disjoint permutations an…
Enriched toric -partitions
Jinting Liang
This paper develops the theory of enriched toric -partitions. Whereas Stembridge's enriched -partitions give rises to the peak algebra which is a subring of the ring…
Rowmotion on rooted trees
Pranjal Dangwal, Jamie Kimble, Jinting Liang +3
A rooted tree T is a poset whose Hasse diagram is a graph-theoretic tree having a unique minimal element. We study rowmotion on antichains and lower order ideals of T. Recently Eli…
Admissible Poisson bialgebras
Jinting Liang, Jiefeng Liu, Chengming Bai
An admissible Poisson algebra (or briefly, an adm-Poisson algebra) gives an equivalent presentation with only one operation for a Poisson algebra. We establish a bialgebra theory f…
Cyclic Pattern Containment and Avoidance
Rachel Domagalski, Jinting Liang, Quinn Minnich +3
The study of pattern containment and avoidance for linear permutations is a well-established area of enumerative combinatorics. A cyclic permutation is the set of all rotations of…
Cyclic Shuffle Compatibility
Rachel Domagalski, Jinting Liang, Quinn Minnich +3
Consider a permutation p to be any finite list of distinct positive integers. A statistic is a function St whose domain is all permutations. Let S(p,q) be the set of shuffles of tw…
Pinnacle Set Properties
Rachel Domagalski, Jinting Liang, Quinn Minnich +3
Let pi = pi_1 pi_2 ... pi_n be a permutation in the symmetric group S_n written in one-line notation. The pinnacle set of pi, denoted Pin pi, is the set of all pi_i such that pi_{i…