5 citations · 7 across the 8 of their papers we have counts for
8 papers
Polynomial encoding of rooted trees with branch lengths
Pengyu Liu, Joan Carles Pons, Gerard Ribas
Phylogenetic trees are rooted trees with branch lengths that record genetic divergence or elapsed time, and quantifying differences between them is central to a wide range of evolu…
Effects of network topology and trait distribution on collective decision making
Pengyu Liu, Jie Jian
Social networks play an important role in analyzing the impact of individual-level interactions on societal or economic outcomes. We model interactive decision making for a communi…
A Generalized Hamming Distance of Sequence Patterns
Pengyu Liu, Jingzhou Na
We define sequence patterns of length and level to be equivalence classes of sequences that have elements from the set of integer symbols $\{1,2,\ldots,\ell\}…
Comparing the topology of phylogenetic network generators
Remie Janssen, Pengyu Liu
Phylogenetic networks represent evolutionary history of species and can record natural reticulate evolutionary processes such as horizontal gene transfer and gene recombination. Th…
A tree distinguishing polynomial
Pengyu Liu
We define a bivariate polynomial for unlabeled rooted trees and show that the polynomial of an unlabeled rooted tree is the generating function of a class of subtrees of . W…
A Diagrammatic Approach for Determining the Braid Index of Alternating Links
Yuanan Diao, Claus Ernst, Gabor Hetyei +1
It is well known that the braid index of a link equals the minimum number of Seifert circles among all link diagrams representing it. For a link with a reduced alternating diagram…
The Braid Index Of Reduced Alternating Links
Yuanan Diao, Gábor Hetyei, Pengyu Liu
It is well known that the minimum crossing number of an alternating link equals the number of crossings in any reduced alternating link diagram of the link. This remarkable result…
The HOMFLY Polynomial of Links in Closed Braid Form
Pengyu Liu, Yuanan Diao, Gábor Hetyei
It is well known that any link can be represented by the closure of a braid. The minimum number of strings needed in a braid whose closure represents a given link is called the bra…