3 citations · 3 across the 8 of their papers we have counts for
4 papers · 1 filter
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…